/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:47:37,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:47:37,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:47:37,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:47:37,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:47:37,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:47:37,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:47:37,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:47:37,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:47:37,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:47:37,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:47:37,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:47:37,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:47:37,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:47:37,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:47:37,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:47:37,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:47:37,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:47:37,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:47:37,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:47:37,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:47:37,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:47:37,978 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:47:37,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-14 00:47:39,208 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7d187b8/349776e676954ff1ac1be3b73f8b56bd/FLAGaddafdba9 [2025-04-14 00:47:39,386 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:47:39,386 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2025-04-14 00:47:39,393 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7d187b8/349776e676954ff1ac1be3b73f8b56bd/FLAGaddafdba9 [2025-04-14 00:47:40,260 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7d187b8/349776e676954ff1ac1be3b73f8b56bd [2025-04-14 00:47:40,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:47:40,263 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:47:40,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:47:40,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:47:40,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:47:40,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f20a938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40, skipping insertion in model container [2025-04-14 00:47:40,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:47:40,605 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-comm.wvr.c[1936,1949] [2025-04-14 00:47:40,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:47:40,615 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:47:40,642 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-comm.wvr.c[1936,1949] [2025-04-14 00:47:40,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:47:40,653 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:47:40,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40 WrapperNode [2025-04-14 00:47:40,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:47:40,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:47:40,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:47:40,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:47:40,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,731 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-14 00:47:40,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:47:40,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:47:40,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:47:40,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:47:40,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,756 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:47:40,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:47:40,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:47:40,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:47:40,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:47:40,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (1/1) ... [2025-04-14 00:47:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:47:40,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:40,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:47:40,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:47:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:47:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:47:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:47:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:47:40,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:47:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:47:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:47:40,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:47:40,820 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:47:40,891 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:47:40,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:47:41,009 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:47:41,010 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:47:41,010 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:47:41,153 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:47:41,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:47:41 BoogieIcfgContainer [2025-04-14 00:47:41,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:47:41,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:47:41,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:47:41,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:47:41,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:47:40" (1/3) ... [2025-04-14 00:47:41,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758a075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:47:41, skipping insertion in model container [2025-04-14 00:47:41,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:47:40" (2/3) ... [2025-04-14 00:47:41,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758a075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:47:41, skipping insertion in model container [2025-04-14 00:47:41,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:47:41" (3/3) ... [2025-04-14 00:47:41,164 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-14 00:47:41,175 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:47:41,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:47:41,176 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:47:41,220 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:47:41,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 00:47:41,274 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-14 00:47:41,279 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:47:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-14 00:47:41,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 00:47:41,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-14 00:47:41,293 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:47:41,304 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;@35000eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:47:41,304 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:47:41,311 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:47:41,311 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-14 00:47:41,311 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:47:41,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:41,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:41,316 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:41,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1525498842, now seen corresponding path program 1 times [2025-04-14 00:47:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:41,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721445553] [2025-04-14 00:47:41,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:41,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:47:41,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:47:41,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:41,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:41,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:41,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721445553] [2025-04-14 00:47:41,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721445553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:47:41,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:47:41,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:47:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620763821] [2025-04-14 00:47:41,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:47:41,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:47:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:41,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:47:41,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:47:41,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:41,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:41,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:41,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:41,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:41,762 INFO L116 PetriNetUnfolderBase]: 68/122 cut-off events. [2025-04-14 00:47:41,762 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 00:47:41,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 122 events. 68/122 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 319 event pairs, 22 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-14 00:47:41,765 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2025-04-14 00:47:41,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 25 transitions, 121 flow [2025-04-14 00:47:41,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:47:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:47:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-14 00:47:41,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2025-04-14 00:47:41,777 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 32 transitions. [2025-04-14 00:47:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 25 transitions, 121 flow [2025-04-14 00:47:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 25 transitions, 107 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:47:41,782 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-14 00:47:41,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2025-04-14 00:47:41,785 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-14 00:47:41,785 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-14 00:47:41,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:41,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:41,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:41,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:47:41,786 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:41,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1110310670, now seen corresponding path program 1 times [2025-04-14 00:47:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:41,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128142594] [2025-04-14 00:47:41,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:47:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:42,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128142594] [2025-04-14 00:47:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128142594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:42,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35023227] [2025-04-14 00:47:42,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:42,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:42,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:42,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:47:42,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:47:42,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:42,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:42,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:47:42,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:42,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35023227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:42,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:42,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 11 [2025-04-14 00:47:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014255967] [2025-04-14 00:47:42,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:42,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:47:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:42,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:47:42,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:47:42,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:42,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:42,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:42,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:42,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:42,734 INFO L116 PetriNetUnfolderBase]: 82/149 cut-off events. [2025-04-14 00:47:42,734 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 00:47:42,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 149 events. 82/149 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 463 event pairs, 2 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2025-04-14 00:47:42,735 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 23 selfloop transitions, 5 changer transitions 22/50 dead transitions. [2025-04-14 00:47:42,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 50 transitions, 241 flow [2025-04-14 00:47:42,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:47:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:47:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2025-04-14 00:47:42,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2025-04-14 00:47:42,738 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 8 states and 67 transitions. [2025-04-14 00:47:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 50 transitions, 241 flow [2025-04-14 00:47:42,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 50 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:47:42,739 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 84 flow [2025-04-14 00:47:42,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2025-04-14 00:47:42,740 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2025-04-14 00:47:42,740 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 84 flow [2025-04-14 00:47:42,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:42,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:42,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:42,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:47:42,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:42,942 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:42,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 790277357, now seen corresponding path program 1 times [2025-04-14 00:47:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:42,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725057131] [2025-04-14 00:47:42,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:42,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:47:42,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:42,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:42,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:43,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725057131] [2025-04-14 00:47:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725057131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:43,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31707412] [2025-04-14 00:47:43,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:43,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:43,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:43,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:43,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:47:43,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:47:43,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:43,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:43,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:43,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:47:43,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:43,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31707412] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:43,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2025-04-14 00:47:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424642391] [2025-04-14 00:47:43,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:43,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:47:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:43,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:47:43,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:47:43,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:43,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:43,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:43,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:43,508 INFO L116 PetriNetUnfolderBase]: 56/104 cut-off events. [2025-04-14 00:47:43,509 INFO L117 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-04-14 00:47:43,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 104 events. 56/104 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 243 event pairs, 9 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 334. Up to 67 conditions per place. [2025-04-14 00:47:43,510 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 19 selfloop transitions, 6 changer transitions 9/34 dead transitions. [2025-04-14 00:47:43,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 215 flow [2025-04-14 00:47:43,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:47:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:47:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-14 00:47:43,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-14 00:47:43,512 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 84 flow. Second operand 6 states and 46 transitions. [2025-04-14 00:47:43,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 215 flow [2025-04-14 00:47:43,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 179 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-14 00:47:43,517 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 92 flow [2025-04-14 00:47:43,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2025-04-14 00:47:43,518 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 9 predicate places. [2025-04-14 00:47:43,518 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 92 flow [2025-04-14 00:47:43,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:43,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:43,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:43,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:47:43,722 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,SelfDestructingSolverStorable2 [2025-04-14 00:47:43,722 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:43,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1274277049, now seen corresponding path program 2 times [2025-04-14 00:47:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:43,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013644017] [2025-04-14 00:47:43,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:43,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:43,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:43,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:43,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013644017] [2025-04-14 00:47:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013644017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:43,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185970755] [2025-04-14 00:47:43,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:43,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:43,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:47:43,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:43,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:43,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:43,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:47:43,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:43,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185970755] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:44,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2025-04-14 00:47:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126731946] [2025-04-14 00:47:44,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:44,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:47:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:44,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:47:44,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:47:44,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:44,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 92 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:44,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:44,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:44,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:44,186 INFO L116 PetriNetUnfolderBase]: 103/190 cut-off events. [2025-04-14 00:47:44,186 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-14 00:47:44,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 190 events. 103/190 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 586 event pairs, 13 based on Foata normal form. 3/193 useless extension candidates. Maximal degree in co-relation 549. Up to 84 conditions per place. [2025-04-14 00:47:44,187 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 18 changer transitions 9/61 dead transitions. [2025-04-14 00:47:44,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 348 flow [2025-04-14 00:47:44,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:47:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:47:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2025-04-14 00:47:44,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2025-04-14 00:47:44,190 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 92 flow. Second operand 10 states and 82 transitions. [2025-04-14 00:47:44,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 348 flow [2025-04-14 00:47:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 61 transitions, 335 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:47:44,192 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 194 flow [2025-04-14 00:47:44,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-04-14 00:47:44,192 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2025-04-14 00:47:44,192 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 194 flow [2025-04-14 00:47:44,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:44,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:44,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:44,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:47:44,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:44,398 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:44,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1296388133, now seen corresponding path program 3 times [2025-04-14 00:47:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:44,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440413077] [2025-04-14 00:47:44,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:47:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:44,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:44,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:44,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:47:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:44,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440413077] [2025-04-14 00:47:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440413077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:44,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178098730] [2025-04-14 00:47:44,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:47:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:44,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:44,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:44,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:47:44,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:44,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:44,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:47:44,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:44,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:47:44,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:44,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178098730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:44,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-14 00:47:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806932949] [2025-04-14 00:47:44,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:44,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:47:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:44,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:47:44,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:47:44,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:44,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:44,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:44,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:44,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:44,865 INFO L116 PetriNetUnfolderBase]: 117/214 cut-off events. [2025-04-14 00:47:44,865 INFO L117 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2025-04-14 00:47:44,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 214 events. 117/214 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 696 event pairs, 18 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 721. Up to 159 conditions per place. [2025-04-14 00:47:44,866 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 38 selfloop transitions, 14 changer transitions 6/58 dead transitions. [2025-04-14 00:47:44,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 413 flow [2025-04-14 00:47:44,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:47:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:47:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-14 00:47:44,868 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-14 00:47:44,869 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 194 flow. Second operand 8 states and 64 transitions. [2025-04-14 00:47:44,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 413 flow [2025-04-14 00:47:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 355 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-14 00:47:44,871 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 230 flow [2025-04-14 00:47:44,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-04-14 00:47:44,872 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 25 predicate places. [2025-04-14 00:47:44,872 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 230 flow [2025-04-14 00:47:44,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:44,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:44,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:44,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:47:45,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:45,078 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:45,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2020517004, now seen corresponding path program 2 times [2025-04-14 00:47:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:45,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204000199] [2025-04-14 00:47:45,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:45,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:45,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:45,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:45,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:45,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204000199] [2025-04-14 00:47:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204000199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:45,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151185284] [2025-04-14 00:47:45,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:45,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:45,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:45,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:47:45,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:45,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:45,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:45,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:45,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 00:47:45,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:45,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:45,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151185284] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:45,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:45,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2025-04-14 00:47:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27325030] [2025-04-14 00:47:45,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:45,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:47:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:45,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:47:45,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:47:45,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:45,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:45,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:45,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:45,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:45,583 INFO L116 PetriNetUnfolderBase]: 145/264 cut-off events. [2025-04-14 00:47:45,583 INFO L117 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-04-14 00:47:45,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 264 events. 145/264 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 936 event pairs, 24 based on Foata normal form. 2/264 useless extension candidates. Maximal degree in co-relation 888. Up to 209 conditions per place. [2025-04-14 00:47:45,584 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 48 selfloop transitions, 14 changer transitions 4/66 dead transitions. [2025-04-14 00:47:45,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 487 flow [2025-04-14 00:47:45,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:47:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:47:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-14 00:47:45,587 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-14 00:47:45,587 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 230 flow. Second operand 8 states and 64 transitions. [2025-04-14 00:47:45,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 487 flow [2025-04-14 00:47:45,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 441 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-04-14 00:47:45,593 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 281 flow [2025-04-14 00:47:45,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-04-14 00:47:45,594 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 31 predicate places. [2025-04-14 00:47:45,594 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 281 flow [2025-04-14 00:47:45,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:45,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:45,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:45,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:47:45,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:45,795 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:45,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1790450600, now seen corresponding path program 3 times [2025-04-14 00:47:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:45,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392128200] [2025-04-14 00:47:45,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:47:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:45,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:45,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:45,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:47:45,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:45,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392128200] [2025-04-14 00:47:45,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392128200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:45,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314048611] [2025-04-14 00:47:45,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:47:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:45,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:45,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:47:45,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-04-14 00:47:45,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:47:45,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:47:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:45,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 00:47:45,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:46,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314048611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:46,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:46,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 12 [2025-04-14 00:47:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044403368] [2025-04-14 00:47:46,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:46,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:47:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:46,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:47:46,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:47:46,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:46,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 281 flow. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:46,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:46,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:46,323 INFO L116 PetriNetUnfolderBase]: 183/335 cut-off events. [2025-04-14 00:47:46,323 INFO L117 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2025-04-14 00:47:46,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 335 events. 183/335 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1275 event pairs, 33 based on Foata normal form. 3/336 useless extension candidates. Maximal degree in co-relation 1179. Up to 238 conditions per place. [2025-04-14 00:47:46,325 INFO L140 encePairwiseOnDemand]: 10/17 looper letters, 55 selfloop transitions, 21 changer transitions 7/83 dead transitions. [2025-04-14 00:47:46,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 628 flow [2025-04-14 00:47:46,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:47:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:47:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2025-04-14 00:47:46,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4385026737967914 [2025-04-14 00:47:46,327 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 281 flow. Second operand 11 states and 82 transitions. [2025-04-14 00:47:46,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 628 flow [2025-04-14 00:47:46,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 580 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-04-14 00:47:46,346 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 376 flow [2025-04-14 00:47:46,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-04-14 00:47:46,346 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 41 predicate places. [2025-04-14 00:47:46,346 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 376 flow [2025-04-14 00:47:46,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:46,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:46,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:46,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:47:46,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:46,549 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:46,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 848599701, now seen corresponding path program 1 times [2025-04-14 00:47:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:46,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021540097] [2025-04-14 00:47:46,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:47:46,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:47:46,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:46,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021540097] [2025-04-14 00:47:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021540097] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:46,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784301500] [2025-04-14 00:47:46,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:47:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:46,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:46,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:46,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 00:47:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:47:46,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:47:46,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:47:46,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:46,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:47:46,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:47,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784301500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:47,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:47:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065558388] [2025-04-14 00:47:47,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:47,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:47:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:47,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:47:47,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:47:47,372 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:47,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 376 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:47,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:47,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:51,996 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:47:56,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:47:56,361 INFO L116 PetriNetUnfolderBase]: 253/480 cut-off events. [2025-04-14 00:47:56,361 INFO L117 PetriNetUnfolderBase]: For 946/946 co-relation queries the response was YES. [2025-04-14 00:47:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 480 events. 253/480 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2186 event pairs, 25 based on Foata normal form. 3/481 useless extension candidates. Maximal degree in co-relation 1692. Up to 240 conditions per place. [2025-04-14 00:47:56,364 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 83 selfloop transitions, 49 changer transitions 30/162 dead transitions. [2025-04-14 00:47:56,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 162 transitions, 1162 flow [2025-04-14 00:47:56,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:47:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:47:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2025-04-14 00:47:56,368 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42892156862745096 [2025-04-14 00:47:56,368 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 376 flow. Second operand 24 states and 175 transitions. [2025-04-14 00:47:56,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 162 transitions, 1162 flow [2025-04-14 00:47:56,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 162 transitions, 1095 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-04-14 00:47:56,374 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 624 flow [2025-04-14 00:47:56,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=624, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2025-04-14 00:47:56,375 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 70 predicate places. [2025-04-14 00:47:56,375 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 624 flow [2025-04-14 00:47:56,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:56,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:56,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:47:56,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:47:56,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:56,576 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:47:56,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1800162097, now seen corresponding path program 2 times [2025-04-14 00:47:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:56,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239121919] [2025-04-14 00:47:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:56,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:47:56,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:47:56,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:56,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:57,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239121919] [2025-04-14 00:47:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239121919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:57,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297734705] [2025-04-14 00:47:57,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:47:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:57,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:57,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:57,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:47:57,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:47:57,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:47:57,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:57,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:57,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:47:57,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:57,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297734705] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:57,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:47:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398822117] [2025-04-14 00:47:57,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:57,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:47:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:57,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:47:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:47:57,669 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:47:57,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 624 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:47:57,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:57,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:47:57,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:07,926 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:11,044 INFO L116 PetriNetUnfolderBase]: 286/566 cut-off events. [2025-04-14 00:48:11,044 INFO L117 PetriNetUnfolderBase]: For 3141/3141 co-relation queries the response was YES. [2025-04-14 00:48:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 566 events. 286/566 cut-off events. For 3141/3141 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2816 event pairs, 20 based on Foata normal form. 3/567 useless extension candidates. Maximal degree in co-relation 2542. Up to 244 conditions per place. [2025-04-14 00:48:11,058 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 94 selfloop transitions, 77 changer transitions 15/186 dead transitions. [2025-04-14 00:48:11,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 186 transitions, 1760 flow [2025-04-14 00:48:11,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:48:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:48:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2025-04-14 00:48:11,060 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-04-14 00:48:11,060 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 624 flow. Second operand 27 states and 198 transitions. [2025-04-14 00:48:11,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 186 transitions, 1760 flow [2025-04-14 00:48:11,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 186 transitions, 1548 flow, removed 88 selfloop flow, removed 12 redundant places. [2025-04-14 00:48:11,070 INFO L231 Difference]: Finished difference. Result has 104 places, 115 transitions, 1025 flow [2025-04-14 00:48:11,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1025, PETRI_PLACES=104, PETRI_TRANSITIONS=115} [2025-04-14 00:48:11,070 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 85 predicate places. [2025-04-14 00:48:11,070 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 1025 flow [2025-04-14 00:48:11,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:11,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:11,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:48:11,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 00:48:11,271 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,SelfDestructingSolverStorable8 [2025-04-14 00:48:11,271 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:48:11,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1802843287, now seen corresponding path program 3 times [2025-04-14 00:48:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:11,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007414820] [2025-04-14 00:48:11,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:48:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:11,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:11,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:11,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:48:11,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:11,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007414820] [2025-04-14 00:48:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007414820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:11,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210632973] [2025-04-14 00:48:11,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:48:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:11,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:48:11,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:48:11,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:11,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:11,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:48:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:11,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:48:11,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:48:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:13,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:48:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:14,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210632973] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:48:14,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:48:14,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:48:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389119038] [2025-04-14 00:48:14,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:48:14,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:48:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:48:14,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:48:14,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:48:14,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:48:14,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 1025 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:14,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:48:14,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:48:14,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:17,800 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-14 00:48:22,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:24,042 INFO L116 PetriNetUnfolderBase]: 277/537 cut-off events. [2025-04-14 00:48:24,042 INFO L117 PetriNetUnfolderBase]: For 2499/2499 co-relation queries the response was YES. [2025-04-14 00:48:24,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 537 events. 277/537 cut-off events. For 2499/2499 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2596 event pairs, 20 based on Foata normal form. 3/532 useless extension candidates. Maximal degree in co-relation 2524. Up to 247 conditions per place. [2025-04-14 00:48:24,047 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 81 selfloop transitions, 79 changer transitions 14/174 dead transitions. [2025-04-14 00:48:24,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 174 transitions, 1646 flow [2025-04-14 00:48:24,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:48:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:48:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 173 transitions. [2025-04-14 00:48:24,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42401960784313725 [2025-04-14 00:48:24,049 INFO L175 Difference]: Start difference. First operand has 104 places, 115 transitions, 1025 flow. Second operand 24 states and 173 transitions. [2025-04-14 00:48:24,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 174 transitions, 1646 flow [2025-04-14 00:48:24,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 174 transitions, 1299 flow, removed 153 selfloop flow, removed 13 redundant places. [2025-04-14 00:48:24,059 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 956 flow [2025-04-14 00:48:24,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=956, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-04-14 00:48:24,061 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 98 predicate places. [2025-04-14 00:48:24,061 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 956 flow [2025-04-14 00:48:24,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:24,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:24,061 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:48:24,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:48:24,262 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,SelfDestructingSolverStorable9 [2025-04-14 00:48:24,262 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:48:24,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 753880794, now seen corresponding path program 4 times [2025-04-14 00:48:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:24,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993039318] [2025-04-14 00:48:24,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:48:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:24,267 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:48:24,278 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:48:24,278 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:48:24,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:24,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993039318] [2025-04-14 00:48:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993039318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:24,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081074142] [2025-04-14 00:48:24,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:48:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:24,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:48:24,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:48:24,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:48:24,681 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:48:24,681 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:48:24,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:24,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:48:24,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:48:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:24,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:48:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081074142] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:48:33,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:48:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-04-14 00:48:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901568919] [2025-04-14 00:48:33,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:48:33,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:48:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:48:33,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:48:33,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=338, Unknown=2, NotChecked=0, Total=420 [2025-04-14 00:48:33,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:48:33,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 956 flow. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:33,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:48:33,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:48:33,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:38,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:42,834 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:47,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:51,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:55,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:48:55,883 INFO L116 PetriNetUnfolderBase]: 382/717 cut-off events. [2025-04-14 00:48:55,883 INFO L117 PetriNetUnfolderBase]: For 2357/2357 co-relation queries the response was YES. [2025-04-14 00:48:55,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 717 events. 382/717 cut-off events. For 2357/2357 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3584 event pairs, 20 based on Foata normal form. 5/706 useless extension candidates. Maximal degree in co-relation 3253. Up to 351 conditions per place. [2025-04-14 00:48:55,886 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 124 selfloop transitions, 87 changer transitions 25/236 dead transitions. [2025-04-14 00:48:55,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 2130 flow [2025-04-14 00:48:55,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:48:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:48:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 229 transitions. [2025-04-14 00:48:55,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40819964349376114 [2025-04-14 00:48:55,888 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 956 flow. Second operand 33 states and 229 transitions. [2025-04-14 00:48:55,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 2130 flow [2025-04-14 00:48:55,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 236 transitions, 1925 flow, removed 39 selfloop flow, removed 19 redundant places. [2025-04-14 00:48:55,897 INFO L231 Difference]: Finished difference. Result has 136 places, 154 transitions, 1377 flow [2025-04-14 00:48:55,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1377, PETRI_PLACES=136, PETRI_TRANSITIONS=154} [2025-04-14 00:48:55,897 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 117 predicate places. [2025-04-14 00:48:55,898 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 154 transitions, 1377 flow [2025-04-14 00:48:55,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:55,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:55,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:48:55,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 00:48:56,102 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,SelfDestructingSolverStorable10 [2025-04-14 00:48:56,102 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:48:56,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2102917353, now seen corresponding path program 5 times [2025-04-14 00:48:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:56,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461618304] [2025-04-14 00:48:56,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:48:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:56,105 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:56,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:56,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:48:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:56,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:56,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461618304] [2025-04-14 00:48:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461618304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:56,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661770529] [2025-04-14 00:48:56,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:48:56,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:56,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:56,386 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:48:56,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 00:48:56,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:56,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:56,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:48:56,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:56,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:48:56,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:48:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:56,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:48:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661770529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:48:57,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:48:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-14 00:48:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944949002] [2025-04-14 00:48:57,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:48:57,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:48:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:48:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:48:57,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:48:57,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:48:57,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 154 transitions, 1377 flow. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:57,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:48:57,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:48:57,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:58,584 INFO L116 PetriNetUnfolderBase]: 430/801 cut-off events. [2025-04-14 00:48:58,584 INFO L117 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-04-14 00:48:58,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 801 events. 430/801 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4116 event pairs, 40 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 4045. Up to 668 conditions per place. [2025-04-14 00:48:58,589 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 170 selfloop transitions, 45 changer transitions 14/229 dead transitions. [2025-04-14 00:48:58,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 229 transitions, 2361 flow [2025-04-14 00:48:58,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:48:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:48:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2025-04-14 00:48:58,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41830065359477125 [2025-04-14 00:48:58,590 INFO L175 Difference]: Start difference. First operand has 136 places, 154 transitions, 1377 flow. Second operand 18 states and 128 transitions. [2025-04-14 00:48:58,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 229 transitions, 2361 flow [2025-04-14 00:48:58,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 229 transitions, 2045 flow, removed 132 selfloop flow, removed 13 redundant places. [2025-04-14 00:48:58,604 INFO L231 Difference]: Finished difference. Result has 145 places, 187 transitions, 1589 flow [2025-04-14 00:48:58,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1589, PETRI_PLACES=145, PETRI_TRANSITIONS=187} [2025-04-14 00:48:58,605 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 126 predicate places. [2025-04-14 00:48:58,605 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 187 transitions, 1589 flow [2025-04-14 00:48:58,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:58,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:58,605 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:48:58,612 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-14 00:48:58,806 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,SelfDestructingSolverStorable11 [2025-04-14 00:48:58,806 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:48:58,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1667293548, now seen corresponding path program 4 times [2025-04-14 00:48:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:58,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673985887] [2025-04-14 00:48:58,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:48:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:58,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:58,814 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:58,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:48:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:58,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673985887] [2025-04-14 00:48:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673985887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:58,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81127210] [2025-04-14 00:48:58,941 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:48:58,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:58,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:48:58,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 00:48:58,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:58,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:58,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:48:58,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:58,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 00:48:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:48:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:59,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:48:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81127210] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:48:59,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:48:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2025-04-14 00:48:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542090229] [2025-04-14 00:48:59,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:48:59,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:48:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:48:59,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:48:59,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:48:59,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:48:59,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 187 transitions, 1589 flow. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:59,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:48:59,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:48:59,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:59,482 INFO L116 PetriNetUnfolderBase]: 429/810 cut-off events. [2025-04-14 00:48:59,482 INFO L117 PetriNetUnfolderBase]: For 2978/2978 co-relation queries the response was YES. [2025-04-14 00:48:59,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 810 events. 429/810 cut-off events. For 2978/2978 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4217 event pairs, 39 based on Foata normal form. 5/789 useless extension candidates. Maximal degree in co-relation 3918. Up to 670 conditions per place. [2025-04-14 00:48:59,503 INFO L140 encePairwiseOnDemand]: 10/17 looper letters, 169 selfloop transitions, 30 changer transitions 29/228 dead transitions. [2025-04-14 00:48:59,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 228 transitions, 2262 flow [2025-04-14 00:48:59,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:48:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:48:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2025-04-14 00:48:59,504 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4343891402714932 [2025-04-14 00:48:59,504 INFO L175 Difference]: Start difference. First operand has 145 places, 187 transitions, 1589 flow. Second operand 13 states and 96 transitions. [2025-04-14 00:48:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 228 transitions, 2262 flow [2025-04-14 00:48:59,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 228 transitions, 2170 flow, removed 34 selfloop flow, removed 4 redundant places. [2025-04-14 00:48:59,516 INFO L231 Difference]: Finished difference. Result has 155 places, 184 transitions, 1536 flow [2025-04-14 00:48:59,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1536, PETRI_PLACES=155, PETRI_TRANSITIONS=184} [2025-04-14 00:48:59,517 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 136 predicate places. [2025-04-14 00:48:59,517 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 184 transitions, 1536 flow [2025-04-14 00:48:59,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:48:59,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:59,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:48:59,522 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-14 00:48:59,718 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,SelfDestructingSolverStorable12 [2025-04-14 00:48:59,718 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:48:59,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 939806235, now seen corresponding path program 6 times [2025-04-14 00:48:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:59,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538545056] [2025-04-14 00:48:59,719 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:48:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:59,721 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:48:59,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:48:59,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:48:59,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:59,997 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-14 00:48:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:59,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538545056] [2025-04-14 00:48:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538545056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:59,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561426800] [2025-04-14 00:48:59,997 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:48:59,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:59,999 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 00:49:00,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:00,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:00,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:00,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:00,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:00,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:00,190 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-14 00:49:00,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:00,818 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-14 00:49:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561426800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:00,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:00,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:00,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123413575] [2025-04-14 00:49:00,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:00,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:00,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:00,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:00,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:00,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 184 transitions, 1536 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:00,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:00,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:00,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:01,415 INFO L116 PetriNetUnfolderBase]: 451/842 cut-off events. [2025-04-14 00:49:01,415 INFO L117 PetriNetUnfolderBase]: For 3539/3539 co-relation queries the response was YES. [2025-04-14 00:49:01,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 842 events. 451/842 cut-off events. For 3539/3539 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4383 event pairs, 36 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 4218. Up to 697 conditions per place. [2025-04-14 00:49:01,421 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 185 selfloop transitions, 53 changer transitions 8/246 dead transitions. [2025-04-14 00:49:01,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 246 transitions, 2528 flow [2025-04-14 00:49:01,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:49:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:49:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 136 transitions. [2025-04-14 00:49:01,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-04-14 00:49:01,422 INFO L175 Difference]: Start difference. First operand has 155 places, 184 transitions, 1536 flow. Second operand 21 states and 136 transitions. [2025-04-14 00:49:01,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 246 transitions, 2528 flow [2025-04-14 00:49:01,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 246 transitions, 2443 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-04-14 00:49:01,454 INFO L231 Difference]: Finished difference. Result has 168 places, 205 transitions, 1929 flow [2025-04-14 00:49:01,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1929, PETRI_PLACES=168, PETRI_TRANSITIONS=205} [2025-04-14 00:49:01,455 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 149 predicate places. [2025-04-14 00:49:01,455 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 205 transitions, 1929 flow [2025-04-14 00:49:01,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:01,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:01,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:01,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 00:49:01,659 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,SelfDestructingSolverStorable13 [2025-04-14 00:49:01,659 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:01,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 995217495, now seen corresponding path program 7 times [2025-04-14 00:49:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:01,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647010013] [2025-04-14 00:49:01,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:01,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:01,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:01,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647010013] [2025-04-14 00:49:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647010013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:01,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548548440] [2025-04-14 00:49:01,864 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:01,866 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 00:49:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:01,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:01,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:01,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:02,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548548440] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:02,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274889628] [2025-04-14 00:49:02,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:02,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:02,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:02,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:02,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:02,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 205 transitions, 1929 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:02,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:02,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:02,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:02,987 INFO L116 PetriNetUnfolderBase]: 452/849 cut-off events. [2025-04-14 00:49:02,987 INFO L117 PetriNetUnfolderBase]: For 4351/4351 co-relation queries the response was YES. [2025-04-14 00:49:02,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4622 conditions, 849 events. 452/849 cut-off events. For 4351/4351 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4457 event pairs, 40 based on Foata normal form. 3/826 useless extension candidates. Maximal degree in co-relation 4536. Up to 756 conditions per place. [2025-04-14 00:49:02,993 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 188 selfloop transitions, 42 changer transitions 6/236 dead transitions. [2025-04-14 00:49:02,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 236 transitions, 2577 flow [2025-04-14 00:49:02,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:49:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:49:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2025-04-14 00:49:02,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2025-04-14 00:49:02,994 INFO L175 Difference]: Start difference. First operand has 168 places, 205 transitions, 1929 flow. Second operand 18 states and 113 transitions. [2025-04-14 00:49:02,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 236 transitions, 2577 flow [2025-04-14 00:49:03,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 236 transitions, 2352 flow, removed 85 selfloop flow, removed 13 redundant places. [2025-04-14 00:49:03,013 INFO L231 Difference]: Finished difference. Result has 176 places, 209 transitions, 1887 flow [2025-04-14 00:49:03,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1887, PETRI_PLACES=176, PETRI_TRANSITIONS=209} [2025-04-14 00:49:03,014 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2025-04-14 00:49:03,014 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 209 transitions, 1887 flow [2025-04-14 00:49:03,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:03,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:03,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:03,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 00:49:03,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:03,218 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:03,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1636817355, now seen corresponding path program 8 times [2025-04-14 00:49:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:03,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140591281] [2025-04-14 00:49:03,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:03,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:03,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:03,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:03,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:03,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-14 00:49:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140591281] [2025-04-14 00:49:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140591281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234584277] [2025-04-14 00:49:03,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:03,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:03,532 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:03,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 00:49:03,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:03,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:03,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:03,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:03,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:03,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:03,728 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-14 00:49:03,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:04,497 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-14 00:49:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234584277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:04,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054507733] [2025-04-14 00:49:04,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:04,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:04,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:04,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:04,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 209 transitions, 1887 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:04,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:04,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:04,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:05,094 INFO L116 PetriNetUnfolderBase]: 483/897 cut-off events. [2025-04-14 00:49:05,094 INFO L117 PetriNetUnfolderBase]: For 5358/5358 co-relation queries the response was YES. [2025-04-14 00:49:05,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5030 conditions, 897 events. 483/897 cut-off events. For 5358/5358 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4757 event pairs, 40 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 4942. Up to 741 conditions per place. [2025-04-14 00:49:05,100 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 187 selfloop transitions, 58 changer transitions 8/253 dead transitions. [2025-04-14 00:49:05,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 253 transitions, 2858 flow [2025-04-14 00:49:05,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:49:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:49:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2025-04-14 00:49:05,101 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38408304498269896 [2025-04-14 00:49:05,101 INFO L175 Difference]: Start difference. First operand has 176 places, 209 transitions, 1887 flow. Second operand 17 states and 111 transitions. [2025-04-14 00:49:05,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 253 transitions, 2858 flow [2025-04-14 00:49:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 253 transitions, 2742 flow, removed 35 selfloop flow, removed 12 redundant places. [2025-04-14 00:49:05,125 INFO L231 Difference]: Finished difference. Result has 184 places, 222 transitions, 2200 flow [2025-04-14 00:49:05,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2200, PETRI_PLACES=184, PETRI_TRANSITIONS=222} [2025-04-14 00:49:05,126 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 165 predicate places. [2025-04-14 00:49:05,126 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 222 transitions, 2200 flow [2025-04-14 00:49:05,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:05,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:05,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:05,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 00:49:05,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 00:49:05,327 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:05,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1744756875, now seen corresponding path program 9 times [2025-04-14 00:49:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:05,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921247988] [2025-04-14 00:49:05,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:49:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:05,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:05,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:05,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:49:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:05,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921247988] [2025-04-14 00:49:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921247988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:05,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307856902] [2025-04-14 00:49:05,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:49:05,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:05,578 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:05,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 00:49:05,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:05,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:05,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:49:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:05,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:05,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:05,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:06,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307856902] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:06,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:06,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264348971] [2025-04-14 00:49:06,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:06,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:06,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:06,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:06,397 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:06,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 222 transitions, 2200 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:06,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:06,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:06,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:06,810 INFO L116 PetriNetUnfolderBase]: 498/928 cut-off events. [2025-04-14 00:49:06,810 INFO L117 PetriNetUnfolderBase]: For 7242/7242 co-relation queries the response was YES. [2025-04-14 00:49:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 928 events. 498/928 cut-off events. For 7242/7242 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4979 event pairs, 42 based on Foata normal form. 3/903 useless extension candidates. Maximal degree in co-relation 5360. Up to 815 conditions per place. [2025-04-14 00:49:06,817 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 205 selfloop transitions, 43 changer transitions 9/257 dead transitions. [2025-04-14 00:49:06,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 257 transitions, 2979 flow [2025-04-14 00:49:06,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:49:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:49:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2025-04-14 00:49:06,818 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.396078431372549 [2025-04-14 00:49:06,818 INFO L175 Difference]: Start difference. First operand has 184 places, 222 transitions, 2200 flow. Second operand 15 states and 101 transitions. [2025-04-14 00:49:06,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 257 transitions, 2979 flow [2025-04-14 00:49:06,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 257 transitions, 2724 flow, removed 106 selfloop flow, removed 9 redundant places. [2025-04-14 00:49:06,846 INFO L231 Difference]: Finished difference. Result has 193 places, 228 transitions, 2218 flow [2025-04-14 00:49:06,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2218, PETRI_PLACES=193, PETRI_TRANSITIONS=228} [2025-04-14 00:49:06,847 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 174 predicate places. [2025-04-14 00:49:06,847 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 228 transitions, 2218 flow [2025-04-14 00:49:06,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:06,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:06,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:06,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 00:49:07,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 00:49:07,050 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:07,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1639498545, now seen corresponding path program 10 times [2025-04-14 00:49:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:07,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249324830] [2025-04-14 00:49:07,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:49:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:07,054 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:07,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:07,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:49:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:07,257 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-14 00:49:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:07,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249324830] [2025-04-14 00:49:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249324830] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:07,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808127096] [2025-04-14 00:49:07,257 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:49:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:07,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:07,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 00:49:07,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:07,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:07,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:49:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:07,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:07,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:07,434 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-14 00:49:07,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:08,464 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-14 00:49:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808127096] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:08,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:08,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201071804] [2025-04-14 00:49:08,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:08,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:08,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:08,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:08,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:08,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 228 transitions, 2218 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:08,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:08,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:09,014 INFO L116 PetriNetUnfolderBase]: 493/918 cut-off events. [2025-04-14 00:49:09,014 INFO L117 PetriNetUnfolderBase]: For 6602/6602 co-relation queries the response was YES. [2025-04-14 00:49:09,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5309 conditions, 918 events. 493/918 cut-off events. For 6602/6602 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4911 event pairs, 40 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 5244. Up to 755 conditions per place. [2025-04-14 00:49:09,020 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 191 selfloop transitions, 63 changer transitions 8/262 dead transitions. [2025-04-14 00:49:09,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 262 transitions, 2949 flow [2025-04-14 00:49:09,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:49:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:49:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2025-04-14 00:49:09,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4083044982698962 [2025-04-14 00:49:09,022 INFO L175 Difference]: Start difference. First operand has 193 places, 228 transitions, 2218 flow. Second operand 17 states and 118 transitions. [2025-04-14 00:49:09,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 262 transitions, 2949 flow [2025-04-14 00:49:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 262 transitions, 2840 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-04-14 00:49:09,048 INFO L231 Difference]: Finished difference. Result has 201 places, 231 transitions, 2343 flow [2025-04-14 00:49:09,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2343, PETRI_PLACES=201, PETRI_TRANSITIONS=231} [2025-04-14 00:49:09,050 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 182 predicate places. [2025-04-14 00:49:09,050 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 231 transitions, 2343 flow [2025-04-14 00:49:09,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:09,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:09,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:09,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 00:49:09,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 00:49:09,251 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:09,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 937326855, now seen corresponding path program 11 times [2025-04-14 00:49:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:09,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622365747] [2025-04-14 00:49:09,252 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:09,254 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:09,258 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:09,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:09,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:09,528 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-14 00:49:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:09,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622365747] [2025-04-14 00:49:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622365747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:09,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579987503] [2025-04-14 00:49:09,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:09,530 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 00:49:09,550 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:09,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:09,599 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:09,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:09,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:09,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:09,735 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-14 00:49:09,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:10,478 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-14 00:49:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579987503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:10,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-14 00:49:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222146565] [2025-04-14 00:49:10,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:10,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:49:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:10,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:49:10,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:49:10,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:10,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 231 transitions, 2343 flow. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:10,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:10,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:11,054 INFO L116 PetriNetUnfolderBase]: 490/913 cut-off events. [2025-04-14 00:49:11,054 INFO L117 PetriNetUnfolderBase]: For 6676/6676 co-relation queries the response was YES. [2025-04-14 00:49:11,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 913 events. 490/913 cut-off events. For 6676/6676 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4861 event pairs, 39 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 5278. Up to 782 conditions per place. [2025-04-14 00:49:11,061 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 201 selfloop transitions, 57 changer transitions 8/266 dead transitions. [2025-04-14 00:49:11,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 266 transitions, 3057 flow [2025-04-14 00:49:11,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:49:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:49:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 126 transitions. [2025-04-14 00:49:11,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2025-04-14 00:49:11,062 INFO L175 Difference]: Start difference. First operand has 201 places, 231 transitions, 2343 flow. Second operand 20 states and 126 transitions. [2025-04-14 00:49:11,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 266 transitions, 3057 flow [2025-04-14 00:49:11,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 266 transitions, 2806 flow, removed 83 selfloop flow, removed 16 redundant places. [2025-04-14 00:49:11,087 INFO L231 Difference]: Finished difference. Result has 208 places, 235 transitions, 2337 flow [2025-04-14 00:49:11,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2337, PETRI_PLACES=208, PETRI_TRANSITIONS=235} [2025-04-14 00:49:11,088 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 189 predicate places. [2025-04-14 00:49:11,088 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 235 transitions, 2337 flow [2025-04-14 00:49:11,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:11,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:11,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:11,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 00:49:11,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:11,289 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:11,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash 597290139, now seen corresponding path program 12 times [2025-04-14 00:49:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:11,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035452365] [2025-04-14 00:49:11,289 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:11,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:11,300 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:11,300 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:11,609 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-14 00:49:11,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:11,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035452365] [2025-04-14 00:49:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035452365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:11,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755241624] [2025-04-14 00:49:11,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:11,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:11,611 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:11,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:49:11,636 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:11,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:11,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:11,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:11,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:11,779 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-14 00:49:11,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:12,414 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-14 00:49:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755241624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:12,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185356497] [2025-04-14 00:49:12,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:12,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:12,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:12,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:12,415 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 235 transitions, 2337 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:12,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:12,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:12,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:13,057 INFO L116 PetriNetUnfolderBase]: 515/960 cut-off events. [2025-04-14 00:49:13,057 INFO L117 PetriNetUnfolderBase]: For 8080/8080 co-relation queries the response was YES. [2025-04-14 00:49:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5782 conditions, 960 events. 515/960 cut-off events. For 8080/8080 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5171 event pairs, 43 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 5683. Up to 811 conditions per place. [2025-04-14 00:49:13,064 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 213 selfloop transitions, 55 changer transitions 9/277 dead transitions. [2025-04-14 00:49:13,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 277 transitions, 3328 flow [2025-04-14 00:49:13,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:49:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:49:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2025-04-14 00:49:13,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2025-04-14 00:49:13,065 INFO L175 Difference]: Start difference. First operand has 208 places, 235 transitions, 2337 flow. Second operand 18 states and 116 transitions. [2025-04-14 00:49:13,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 277 transitions, 3328 flow [2025-04-14 00:49:13,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 277 transitions, 3179 flow, removed 40 selfloop flow, removed 14 redundant places. [2025-04-14 00:49:13,100 INFO L231 Difference]: Finished difference. Result has 214 places, 245 transitions, 2580 flow [2025-04-14 00:49:13,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2580, PETRI_PLACES=214, PETRI_TRANSITIONS=245} [2025-04-14 00:49:13,101 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 195 predicate places. [2025-04-14 00:49:13,101 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 245 transitions, 2580 flow [2025-04-14 00:49:13,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:13,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:13,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:13,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-14 00:49:13,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:13,302 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:13,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1943545509, now seen corresponding path program 13 times [2025-04-14 00:49:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:13,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541426700] [2025-04-14 00:49:13,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:13,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:13,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:13,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:13,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541426700] [2025-04-14 00:49:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541426700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:13,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884929205] [2025-04-14 00:49:13,534 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:13,536 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-14 00:49:13,538 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-14 00:49:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:13,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:13,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:13,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:13,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:13,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884929205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054012637] [2025-04-14 00:49:14,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:14,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:14,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:14,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:14,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:14,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 245 transitions, 2580 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:14,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:14,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:14,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:18,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:49:22,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:49:23,103 INFO L116 PetriNetUnfolderBase]: 565/1056 cut-off events. [2025-04-14 00:49:23,103 INFO L117 PetriNetUnfolderBase]: For 10408/10408 co-relation queries the response was YES. [2025-04-14 00:49:23,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 1056 events. 565/1056 cut-off events. For 10408/10408 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5862 event pairs, 40 based on Foata normal form. 3/1033 useless extension candidates. Maximal degree in co-relation 6418. Up to 841 conditions per place. [2025-04-14 00:49:23,110 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 230 selfloop transitions, 70 changer transitions 27/327 dead transitions. [2025-04-14 00:49:23,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 327 transitions, 3978 flow [2025-04-14 00:49:23,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:49:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:49:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 159 transitions. [2025-04-14 00:49:23,111 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3897058823529412 [2025-04-14 00:49:23,111 INFO L175 Difference]: Start difference. First operand has 214 places, 245 transitions, 2580 flow. Second operand 24 states and 159 transitions. [2025-04-14 00:49:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 327 transitions, 3978 flow [2025-04-14 00:49:23,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 327 transitions, 3780 flow, removed 72 selfloop flow, removed 14 redundant places. [2025-04-14 00:49:23,150 INFO L231 Difference]: Finished difference. Result has 231 places, 270 transitions, 2941 flow [2025-04-14 00:49:23,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2941, PETRI_PLACES=231, PETRI_TRANSITIONS=270} [2025-04-14 00:49:23,151 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 212 predicate places. [2025-04-14 00:49:23,151 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 270 transitions, 2941 flow [2025-04-14 00:49:23,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:23,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:23,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:23,157 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-14 00:49:23,351 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,SelfDestructingSolverStorable20 [2025-04-14 00:49:23,352 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:23,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash 594810759, now seen corresponding path program 14 times [2025-04-14 00:49:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:23,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472478540] [2025-04-14 00:49:23,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:23,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:23,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:23,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:23,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:23,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:23,665 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-14 00:49:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:23,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472478540] [2025-04-14 00:49:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472478540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:23,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5226396] [2025-04-14 00:49:23,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:23,667 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-14 00:49:23,669 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-14 00:49:23,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:23,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:23,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:23,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:23,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:23,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:23,838 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-14 00:49:23,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:24,435 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-14 00:49:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5226396] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:24,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:24,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174792111] [2025-04-14 00:49:24,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:24,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:24,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:24,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:24,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:24,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 270 transitions, 2941 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:24,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:24,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:24,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:25,144 INFO L116 PetriNetUnfolderBase]: 549/1027 cut-off events. [2025-04-14 00:49:25,145 INFO L117 PetriNetUnfolderBase]: For 10019/10019 co-relation queries the response was YES. [2025-04-14 00:49:25,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6375 conditions, 1027 events. 549/1027 cut-off events. For 10019/10019 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 5649 event pairs, 42 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 6267. Up to 882 conditions per place. [2025-04-14 00:49:25,152 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 243 selfloop transitions, 56 changer transitions 8/307 dead transitions. [2025-04-14 00:49:25,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 307 transitions, 3790 flow [2025-04-14 00:49:25,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:49:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:49:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2025-04-14 00:49:25,153 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4024767801857585 [2025-04-14 00:49:25,153 INFO L175 Difference]: Start difference. First operand has 231 places, 270 transitions, 2941 flow. Second operand 19 states and 130 transitions. [2025-04-14 00:49:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 307 transitions, 3790 flow [2025-04-14 00:49:25,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 307 transitions, 3479 flow, removed 134 selfloop flow, removed 11 redundant places. [2025-04-14 00:49:25,196 INFO L231 Difference]: Finished difference. Result has 237 places, 273 transitions, 2875 flow [2025-04-14 00:49:25,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2875, PETRI_PLACES=237, PETRI_TRANSITIONS=273} [2025-04-14 00:49:25,197 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 218 predicate places. [2025-04-14 00:49:25,197 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 273 transitions, 2875 flow [2025-04-14 00:49:25,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:25,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:25,203 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-14 00:49:25,401 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,SelfDestructingSolverStorable21 [2025-04-14 00:49:25,401 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:25,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1139487593, now seen corresponding path program 15 times [2025-04-14 00:49:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:25,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777596745] [2025-04-14 00:49:25,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:49:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:25,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:25,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:25,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:49:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:25,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777596745] [2025-04-14 00:49:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777596745] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:25,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773537274] [2025-04-14 00:49:25,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:49:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:25,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:25,650 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-14 00:49:25,651 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-14 00:49:25,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:25,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:25,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:49:25,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:25,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:25,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:25,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773537274] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:26,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:26,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-14 00:49:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646826647] [2025-04-14 00:49:26,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:26,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:49:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:26,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:49:26,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:49:26,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:26,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 273 transitions, 2875 flow. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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-14 00:49:26,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:26,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:26,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:26,908 INFO L116 PetriNetUnfolderBase]: 591/1119 cut-off events. [2025-04-14 00:49:26,909 INFO L117 PetriNetUnfolderBase]: For 14169/14169 co-relation queries the response was YES. [2025-04-14 00:49:26,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7394 conditions, 1119 events. 591/1119 cut-off events. For 14169/14169 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6372 event pairs, 43 based on Foata normal form. 3/1094 useless extension candidates. Maximal degree in co-relation 7318. Up to 845 conditions per place. [2025-04-14 00:49:26,915 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 239 selfloop transitions, 100 changer transitions 12/351 dead transitions. [2025-04-14 00:49:26,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 351 transitions, 4733 flow [2025-04-14 00:49:26,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:49:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:49:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 170 transitions. [2025-04-14 00:49:26,916 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 00:49:26,916 INFO L175 Difference]: Start difference. First operand has 237 places, 273 transitions, 2875 flow. Second operand 24 states and 170 transitions. [2025-04-14 00:49:26,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 351 transitions, 4733 flow [2025-04-14 00:49:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 351 transitions, 4490 flow, removed 87 selfloop flow, removed 16 redundant places. [2025-04-14 00:49:26,963 INFO L231 Difference]: Finished difference. Result has 255 places, 297 transitions, 3638 flow [2025-04-14 00:49:26,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3638, PETRI_PLACES=255, PETRI_TRANSITIONS=297} [2025-04-14 00:49:26,964 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 236 predicate places. [2025-04-14 00:49:26,964 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 297 transitions, 3638 flow [2025-04-14 00:49:26,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 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-14 00:49:26,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:26,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:26,970 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-14 00:49:27,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:27,165 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:27,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1123532947, now seen corresponding path program 16 times [2025-04-14 00:49:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:27,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064335598] [2025-04-14 00:49:27,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:49:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:27,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:27,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:27,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:49:27,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:27,388 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-14 00:49:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:27,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064335598] [2025-04-14 00:49:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064335598] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:27,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247096600] [2025-04-14 00:49:27,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:49:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:27,390 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-14 00:49:27,390 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-14 00:49:27,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:27,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:27,432 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:49:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:27,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:27,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:27,567 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-14 00:49:27,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:28,109 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-14 00:49:28,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247096600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:28,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:28,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:28,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970313525] [2025-04-14 00:49:28,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:28,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:28,110 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:28,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 297 transitions, 3638 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:28,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:28,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:28,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:28,757 INFO L116 PetriNetUnfolderBase]: 620/1165 cut-off events. [2025-04-14 00:49:28,757 INFO L117 PetriNetUnfolderBase]: For 18866/18866 co-relation queries the response was YES. [2025-04-14 00:49:28,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8378 conditions, 1165 events. 620/1165 cut-off events. For 18866/18866 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6639 event pairs, 48 based on Foata normal form. 2/1139 useless extension candidates. Maximal degree in co-relation 8261. Up to 1031 conditions per place. [2025-04-14 00:49:28,767 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 277 selfloop transitions, 54 changer transitions 8/339 dead transitions. [2025-04-14 00:49:28,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 339 transitions, 4964 flow [2025-04-14 00:49:28,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:49:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:49:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2025-04-14 00:49:28,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3771626297577855 [2025-04-14 00:49:28,770 INFO L175 Difference]: Start difference. First operand has 255 places, 297 transitions, 3638 flow. Second operand 17 states and 109 transitions. [2025-04-14 00:49:28,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 339 transitions, 4964 flow [2025-04-14 00:49:28,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 339 transitions, 4465 flow, removed 228 selfloop flow, removed 11 redundant places. [2025-04-14 00:49:28,864 INFO L231 Difference]: Finished difference. Result has 263 places, 310 transitions, 3740 flow [2025-04-14 00:49:28,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3145, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3740, PETRI_PLACES=263, PETRI_TRANSITIONS=310} [2025-04-14 00:49:28,866 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 244 predicate places. [2025-04-14 00:49:28,866 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 310 transitions, 3740 flow [2025-04-14 00:49:28,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:28,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:28,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:28,872 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-14 00:49:29,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:29,067 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:29,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1141966973, now seen corresponding path program 17 times [2025-04-14 00:49:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:29,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440714276] [2025-04-14 00:49:29,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:29,069 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:29,074 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:29,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:29,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:29,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440714276] [2025-04-14 00:49:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440714276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:29,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222162157] [2025-04-14 00:49:29,352 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:29,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:29,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:29,354 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-14 00:49:29,354 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-14 00:49:29,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:29,422 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:29,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:29,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:29,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:29,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:29,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222162157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:29,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-14 00:49:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255594890] [2025-04-14 00:49:29,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:29,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:49:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:29,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:49:29,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-04-14 00:49:29,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:29,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 310 transitions, 3740 flow. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:29,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:29,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:29,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:32,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:49:34,618 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:49:35,034 INFO L116 PetriNetUnfolderBase]: 620/1162 cut-off events. [2025-04-14 00:49:35,034 INFO L117 PetriNetUnfolderBase]: For 18764/18764 co-relation queries the response was YES. [2025-04-14 00:49:35,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8057 conditions, 1162 events. 620/1162 cut-off events. For 18764/18764 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6621 event pairs, 41 based on Foata normal form. 3/1135 useless extension candidates. Maximal degree in co-relation 7937. Up to 899 conditions per place. [2025-04-14 00:49:35,044 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 243 selfloop transitions, 100 changer transitions 13/356 dead transitions. [2025-04-14 00:49:35,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 356 transitions, 4738 flow [2025-04-14 00:49:35,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:49:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:49:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 161 transitions. [2025-04-14 00:49:35,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3946078431372549 [2025-04-14 00:49:35,044 INFO L175 Difference]: Start difference. First operand has 263 places, 310 transitions, 3740 flow. Second operand 24 states and 161 transitions. [2025-04-14 00:49:35,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 356 transitions, 4738 flow [2025-04-14 00:49:35,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 356 transitions, 4405 flow, removed 149 selfloop flow, removed 9 redundant places. [2025-04-14 00:49:35,141 INFO L231 Difference]: Finished difference. Result has 281 places, 313 transitions, 3759 flow [2025-04-14 00:49:35,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3411, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3759, PETRI_PLACES=281, PETRI_TRANSITIONS=313} [2025-04-14 00:49:35,141 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 262 predicate places. [2025-04-14 00:49:35,141 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 313 transitions, 3759 flow [2025-04-14 00:49:35,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:35,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:35,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:35,148 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-14 00:49:35,342 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,SelfDestructingSolverStorable24 [2025-04-14 00:49:35,343 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:35,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1121053567, now seen corresponding path program 18 times [2025-04-14 00:49:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:35,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702764049] [2025-04-14 00:49:35,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:35,345 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:35,349 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:35,349 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:35,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:35,593 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-14 00:49:35,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:35,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702764049] [2025-04-14 00:49:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702764049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:35,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668962594] [2025-04-14 00:49:35,593 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:35,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:35,596 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-14 00:49:35,596 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-14 00:49:35,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 00:49:35,681 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:35,681 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:35,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:35,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:35,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:35,775 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-14 00:49:35,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:36,304 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-14 00:49:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668962594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:36,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977813207] [2025-04-14 00:49:36,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:36,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:36,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:36,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 313 transitions, 3759 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:36,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:36,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:36,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:36,833 INFO L116 PetriNetUnfolderBase]: 618/1160 cut-off events. [2025-04-14 00:49:36,833 INFO L117 PetriNetUnfolderBase]: For 16906/16906 co-relation queries the response was YES. [2025-04-14 00:49:36,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 1160 events. 618/1160 cut-off events. For 16906/16906 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6616 event pairs, 46 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 7809. Up to 1024 conditions per place. [2025-04-14 00:49:36,843 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 280 selfloop transitions, 57 changer transitions 7/344 dead transitions. [2025-04-14 00:49:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 344 transitions, 4722 flow [2025-04-14 00:49:36,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:49:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:49:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2025-04-14 00:49:36,844 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39338235294117646 [2025-04-14 00:49:36,844 INFO L175 Difference]: Start difference. First operand has 281 places, 313 transitions, 3759 flow. Second operand 16 states and 107 transitions. [2025-04-14 00:49:36,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 344 transitions, 4722 flow [2025-04-14 00:49:36,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 344 transitions, 4379 flow, removed 95 selfloop flow, removed 17 redundant places. [2025-04-14 00:49:36,920 INFO L231 Difference]: Finished difference. Result has 278 places, 318 transitions, 3690 flow [2025-04-14 00:49:36,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3690, PETRI_PLACES=278, PETRI_TRANSITIONS=318} [2025-04-14 00:49:36,921 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 259 predicate places. [2025-04-14 00:49:36,921 INFO L485 AbstractCegarLoop]: Abstraction has has 278 places, 318 transitions, 3690 flow [2025-04-14 00:49:36,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:36,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:36,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:36,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-14 00:49:37,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 00:49:37,121 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:37,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1065642307, now seen corresponding path program 19 times [2025-04-14 00:49:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:37,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716508134] [2025-04-14 00:49:37,122 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:37,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:37,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:37,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:37,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:37,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716508134] [2025-04-14 00:49:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716508134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:37,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415167763] [2025-04-14 00:49:37,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:49:37,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:37,300 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-14 00:49:37,301 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-14 00:49:37,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:49:37,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:49:37,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:49:37,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:37,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 00:49:37,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:37,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415167763] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:38,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-14 00:49:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062127065] [2025-04-14 00:49:38,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:38,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:49:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:38,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:49:38,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:49:38,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:38,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 318 transitions, 3690 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:38,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:38,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:38,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:38,581 INFO L116 PetriNetUnfolderBase]: 620/1172 cut-off events. [2025-04-14 00:49:38,581 INFO L117 PetriNetUnfolderBase]: For 13178/13178 co-relation queries the response was YES. [2025-04-14 00:49:38,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7684 conditions, 1172 events. 620/1172 cut-off events. For 13178/13178 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6734 event pairs, 49 based on Foata normal form. 3/1147 useless extension candidates. Maximal degree in co-relation 7590. Up to 1086 conditions per place. [2025-04-14 00:49:38,589 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 300 selfloop transitions, 39 changer transitions 7/346 dead transitions. [2025-04-14 00:49:38,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 346 transitions, 4621 flow [2025-04-14 00:49:38,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:49:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:49:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2025-04-14 00:49:38,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-04-14 00:49:38,590 INFO L175 Difference]: Start difference. First operand has 278 places, 318 transitions, 3690 flow. Second operand 16 states and 100 transitions. [2025-04-14 00:49:38,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 346 transitions, 4621 flow [2025-04-14 00:49:38,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 346 transitions, 4474 flow, removed 53 selfloop flow, removed 11 redundant places. [2025-04-14 00:49:38,664 INFO L231 Difference]: Finished difference. Result has 285 places, 321 transitions, 3722 flow [2025-04-14 00:49:38,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3722, PETRI_PLACES=285, PETRI_TRANSITIONS=321} [2025-04-14 00:49:38,665 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 266 predicate places. [2025-04-14 00:49:38,665 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 321 transitions, 3722 flow [2025-04-14 00:49:38,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:38,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:38,665 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:38,671 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-14 00:49:38,865 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,SelfDestructingSolverStorable26 [2025-04-14 00:49:38,865 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:38,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -181348411, now seen corresponding path program 5 times [2025-04-14 00:49:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:38,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486775179] [2025-04-14 00:49:38,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:38,868 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:38,872 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:38,872 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:38,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486775179] [2025-04-14 00:49:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486775179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:38,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047851661] [2025-04-14 00:49:38,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:49:38,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:38,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:38,946 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:38,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 00:49:38,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:38,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:38,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:38,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:38,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:49:38,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:39,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:39,148 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-14 00:49:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047851661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:39,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 12 [2025-04-14 00:49:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519176327] [2025-04-14 00:49:39,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:39,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:49:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:39,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:49:39,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:49:39,149 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:39,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 321 transitions, 3722 flow. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:39,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:39,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:39,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:39,955 INFO L116 PetriNetUnfolderBase]: 625/1188 cut-off events. [2025-04-14 00:49:39,955 INFO L117 PetriNetUnfolderBase]: For 13421/13421 co-relation queries the response was YES. [2025-04-14 00:49:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 1188 events. 625/1188 cut-off events. For 13421/13421 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6871 event pairs, 26 based on Foata normal form. 5/1165 useless extension candidates. Maximal degree in co-relation 7692. Up to 934 conditions per place. [2025-04-14 00:49:39,964 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 275 selfloop transitions, 70 changer transitions 22/367 dead transitions. [2025-04-14 00:49:39,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 367 transitions, 4940 flow [2025-04-14 00:49:39,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:49:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:49:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2025-04-14 00:49:39,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42214532871972316 [2025-04-14 00:49:39,965 INFO L175 Difference]: Start difference. First operand has 285 places, 321 transitions, 3722 flow. Second operand 17 states and 122 transitions. [2025-04-14 00:49:39,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 367 transitions, 4940 flow [2025-04-14 00:49:40,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 367 transitions, 4800 flow, removed 40 selfloop flow, removed 12 redundant places. [2025-04-14 00:49:40,067 INFO L231 Difference]: Finished difference. Result has 291 places, 319 transitions, 3759 flow [2025-04-14 00:49:40,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3584, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3759, PETRI_PLACES=291, PETRI_TRANSITIONS=319} [2025-04-14 00:49:40,068 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 272 predicate places. [2025-04-14 00:49:40,068 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 319 transitions, 3759 flow [2025-04-14 00:49:40,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:40,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:40,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:40,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 00:49:40,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 00:49:40,268 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:40,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash 615865793, now seen corresponding path program 6 times [2025-04-14 00:49:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:40,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109129469] [2025-04-14 00:49:40,269 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:40,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:40,277 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:40,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:40,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:40,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109129469] [2025-04-14 00:49:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109129469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:40,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984079001] [2025-04-14 00:49:40,383 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:49:40,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:40,385 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:40,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 00:49:40,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:40,419 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:40,419 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:49:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:40,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 00:49:40,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:40,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:49:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984079001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:40,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 13 [2025-04-14 00:49:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319688332] [2025-04-14 00:49:40,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:40,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:49:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:40,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:49:40,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:49:40,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:40,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 319 transitions, 3759 flow. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:40,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:40,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:40,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:41,293 INFO L116 PetriNetUnfolderBase]: 651/1231 cut-off events. [2025-04-14 00:49:41,293 INFO L117 PetriNetUnfolderBase]: For 17052/17052 co-relation queries the response was YES. [2025-04-14 00:49:41,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8437 conditions, 1231 events. 651/1231 cut-off events. For 17052/17052 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7150 event pairs, 26 based on Foata normal form. 3/1206 useless extension candidates. Maximal degree in co-relation 8309. Up to 894 conditions per place. [2025-04-14 00:49:41,303 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 286 selfloop transitions, 74 changer transitions 8/368 dead transitions. [2025-04-14 00:49:41,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 368 transitions, 5028 flow [2025-04-14 00:49:41,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:49:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:49:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2025-04-14 00:49:41,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2025-04-14 00:49:41,304 INFO L175 Difference]: Start difference. First operand has 291 places, 319 transitions, 3759 flow. Second operand 15 states and 108 transitions. [2025-04-14 00:49:41,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 368 transitions, 5028 flow [2025-04-14 00:49:41,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 368 transitions, 4888 flow, removed 19 selfloop flow, removed 14 redundant places. [2025-04-14 00:49:41,403 INFO L231 Difference]: Finished difference. Result has 291 places, 330 transitions, 4066 flow [2025-04-14 00:49:41,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3623, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4066, PETRI_PLACES=291, PETRI_TRANSITIONS=330} [2025-04-14 00:49:41,404 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 272 predicate places. [2025-04-14 00:49:41,404 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 330 transitions, 4066 flow [2025-04-14 00:49:41,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:49:41,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:49:41,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:49:41,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 00:49:41,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 00:49:41,605 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:49:41,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:49:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 591132536, now seen corresponding path program 20 times [2025-04-14 00:49:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:49:41,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405938809] [2025-04-14 00:49:41,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:49:41,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:41,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:41,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:41,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:43,970 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-14 00:49:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:49:43,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405938809] [2025-04-14 00:49:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405938809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:49:43,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659533305] [2025-04-14 00:49:43,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:49:43,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:49:43,975 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:49:43,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 00:49:44,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:49:44,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:49:44,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:49:44,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:49:44,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:49:44,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:49:44,149 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-14 00:49:44,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:49:48,700 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-14 00:49:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659533305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:49:48,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:49:48,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-04-14 00:49:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507200460] [2025-04-14 00:49:48,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:49:48,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 00:49:48,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:49:48,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 00:49:48,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=268, Unknown=1, NotChecked=0, Total=342 [2025-04-14 00:49:48,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:49:48,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 330 transitions, 4066 flow. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 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-14 00:49:48,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:49:48,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:49:48,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:49:52,805 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:49:57,218 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:01,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:05,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:09,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:13,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:14,453 INFO L116 PetriNetUnfolderBase]: 692/1322 cut-off events. [2025-04-14 00:50:14,453 INFO L117 PetriNetUnfolderBase]: For 20398/20398 co-relation queries the response was YES. [2025-04-14 00:50:14,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9352 conditions, 1322 events. 692/1322 cut-off events. For 20398/20398 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7907 event pairs, 46 based on Foata normal form. 3/1303 useless extension candidates. Maximal degree in co-relation 9214. Up to 1083 conditions per place. [2025-04-14 00:50:14,461 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 293 selfloop transitions, 95 changer transitions 14/402 dead transitions. [2025-04-14 00:50:14,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 402 transitions, 5483 flow [2025-04-14 00:50:14,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:50:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:50:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 180 transitions. [2025-04-14 00:50:14,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-04-14 00:50:14,463 INFO L175 Difference]: Start difference. First operand has 291 places, 330 transitions, 4066 flow. Second operand 27 states and 180 transitions. [2025-04-14 00:50:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 402 transitions, 5483 flow [2025-04-14 00:50:14,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 402 transitions, 5295 flow, removed 71 selfloop flow, removed 9 redundant places. [2025-04-14 00:50:14,565 INFO L231 Difference]: Finished difference. Result has 317 places, 349 transitions, 4528 flow [2025-04-14 00:50:14,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3938, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4528, PETRI_PLACES=317, PETRI_TRANSITIONS=349} [2025-04-14 00:50:14,566 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 298 predicate places. [2025-04-14 00:50:14,566 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 349 transitions, 4528 flow [2025-04-14 00:50:14,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 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-14 00:50:14,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:50:14,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:50:14,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 00:50:14,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:14,767 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:50:14,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:50:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash 54194522, now seen corresponding path program 21 times [2025-04-14 00:50:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:50:14,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730499343] [2025-04-14 00:50:14,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:50:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:50:14,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:14,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:14,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:50:14,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:16,416 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-14 00:50:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:50:16,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730499343] [2025-04-14 00:50:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730499343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:50:16,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435999415] [2025-04-14 00:50:16,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:50:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:50:16,418 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:50:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 00:50:16,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:16,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:16,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:50:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:16,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:50:16,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:50:16,729 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-14 00:50:16,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:50:21,202 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-14 00:50:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435999415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:50:21,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:50:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-14 00:50:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286288326] [2025-04-14 00:50:21,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:50:21,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:50:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:50:21,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:50:21,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2025-04-14 00:50:21,203 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:50:21,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 349 transitions, 4528 flow. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 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-14 00:50:21,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:50:21,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:50:21,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:50:25,364 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:30,264 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:34,314 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:38,641 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:42,840 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:46,860 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:50:47,129 INFO L116 PetriNetUnfolderBase]: 683/1314 cut-off events. [2025-04-14 00:50:47,129 INFO L117 PetriNetUnfolderBase]: For 20394/20394 co-relation queries the response was YES. [2025-04-14 00:50:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 1314 events. 683/1314 cut-off events. For 20394/20394 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7907 event pairs, 53 based on Foata normal form. 4/1298 useless extension candidates. Maximal degree in co-relation 9438. Up to 1140 conditions per place. [2025-04-14 00:50:47,139 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 291 selfloop transitions, 92 changer transitions 8/391 dead transitions. [2025-04-14 00:50:47,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 391 transitions, 5596 flow [2025-04-14 00:50:47,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:50:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:50:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 171 transitions. [2025-04-14 00:50:47,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2025-04-14 00:50:47,140 INFO L175 Difference]: Start difference. First operand has 317 places, 349 transitions, 4528 flow. Second operand 27 states and 171 transitions. [2025-04-14 00:50:47,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 391 transitions, 5596 flow [2025-04-14 00:50:47,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 391 transitions, 5370 flow, removed 67 selfloop flow, removed 21 redundant places. [2025-04-14 00:50:47,250 INFO L231 Difference]: Finished difference. Result has 325 places, 350 transitions, 4587 flow [2025-04-14 00:50:47,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4302, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4587, PETRI_PLACES=325, PETRI_TRANSITIONS=350} [2025-04-14 00:50:47,250 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 306 predicate places. [2025-04-14 00:50:47,250 INFO L485 AbstractCegarLoop]: Abstraction has has 325 places, 350 transitions, 4587 flow [2025-04-14 00:50:47,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 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-14 00:50:47,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:50:47,251 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:50:47,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 00:50:47,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-14 00:50:47,451 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:50:47,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:50:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -23268805, now seen corresponding path program 22 times [2025-04-14 00:50:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:50:47,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680673959] [2025-04-14 00:50:47,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:50:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:50:47,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:47,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:47,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:50:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:47,846 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-14 00:50:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:50:47,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680673959] [2025-04-14 00:50:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680673959] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:50:47,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113784371] [2025-04-14 00:50:47,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:50:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:50:47,848 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:50:47,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 00:50:47,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:47,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:47,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:50:47,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:50:47,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:50:48,107 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-14 00:50:48,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:50:50,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-14 00:50:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113784371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:50:50,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:50:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-14 00:50:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173250680] [2025-04-14 00:50:50,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:50:50,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:50:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:50:50,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:50:50,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:50:50,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:50:50,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 350 transitions, 4587 flow. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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-14 00:50:50,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:50:50,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:50:50,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:50:51,823 INFO L116 PetriNetUnfolderBase]: 691/1324 cut-off events. [2025-04-14 00:50:51,823 INFO L117 PetriNetUnfolderBase]: For 20175/20175 co-relation queries the response was YES. [2025-04-14 00:50:51,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9697 conditions, 1324 events. 691/1324 cut-off events. For 20175/20175 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7966 event pairs, 32 based on Foata normal form. 4/1308 useless extension candidates. Maximal degree in co-relation 9540. Up to 1013 conditions per place. [2025-04-14 00:50:51,834 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 278 selfloop transitions, 121 changer transitions 12/411 dead transitions. [2025-04-14 00:50:51,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 411 transitions, 5740 flow [2025-04-14 00:50:51,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:50:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:50:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 194 transitions. [2025-04-14 00:50:51,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3803921568627451 [2025-04-14 00:50:51,835 INFO L175 Difference]: Start difference. First operand has 325 places, 350 transitions, 4587 flow. Second operand 30 states and 194 transitions. [2025-04-14 00:50:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 411 transitions, 5740 flow [2025-04-14 00:50:51,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 411 transitions, 5549 flow, removed 43 selfloop flow, removed 23 redundant places. [2025-04-14 00:50:51,943 INFO L231 Difference]: Finished difference. Result has 333 places, 353 transitions, 4759 flow [2025-04-14 00:50:51,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4391, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4759, PETRI_PLACES=333, PETRI_TRANSITIONS=353} [2025-04-14 00:50:51,944 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 314 predicate places. [2025-04-14 00:50:51,944 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 353 transitions, 4759 flow [2025-04-14 00:50:51,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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-14 00:50:51,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:50:51,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:50:51,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 00:50:52,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:52,145 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:50:52,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:50:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1002434151, now seen corresponding path program 23 times [2025-04-14 00:50:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:50:52,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625415264] [2025-04-14 00:50:52,145 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:50:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:50:52,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:52,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:52,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:50:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:50:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:50:58,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625415264] [2025-04-14 00:50:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625415264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:50:58,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960613334] [2025-04-14 00:50:58,013 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:50:58,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:50:58,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:50:58,015 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:50:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 00:50:58,036 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:50:58,057 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:50:58,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:50:58,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:50:58,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:50:58,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:51:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:06,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:51:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960613334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:51:23,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:51:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-14 00:51:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109031964] [2025-04-14 00:51:23,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:51:23,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:51:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:23,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:51:23,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=377, Unknown=6, NotChecked=0, Total=462 [2025-04-14 00:51:23,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:51:23,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 353 transitions, 4759 flow. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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-14 00:51:23,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:23,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:51:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:28,624 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:51:29,066 INFO L116 PetriNetUnfolderBase]: 695/1333 cut-off events. [2025-04-14 00:51:29,066 INFO L117 PetriNetUnfolderBase]: For 20910/20910 co-relation queries the response was YES. [2025-04-14 00:51:29,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10076 conditions, 1333 events. 695/1333 cut-off events. For 20910/20910 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8042 event pairs, 40 based on Foata normal form. 3/1316 useless extension candidates. Maximal degree in co-relation 9909. Up to 1090 conditions per place. [2025-04-14 00:51:29,080 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 312 selfloop transitions, 82 changer transitions 11/405 dead transitions. [2025-04-14 00:51:29,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 405 transitions, 5915 flow [2025-04-14 00:51:29,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:51:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:51:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 159 transitions. [2025-04-14 00:51:29,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3897058823529412 [2025-04-14 00:51:29,082 INFO L175 Difference]: Start difference. First operand has 333 places, 353 transitions, 4759 flow. Second operand 24 states and 159 transitions. [2025-04-14 00:51:29,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 405 transitions, 5915 flow [2025-04-14 00:51:29,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 405 transitions, 5622 flow, removed 55 selfloop flow, removed 26 redundant places. [2025-04-14 00:51:29,204 INFO L231 Difference]: Finished difference. Result has 334 places, 356 transitions, 4768 flow [2025-04-14 00:51:29,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4466, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4768, PETRI_PLACES=334, PETRI_TRANSITIONS=356} [2025-04-14 00:51:29,204 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 315 predicate places. [2025-04-14 00:51:29,204 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 356 transitions, 4768 flow [2025-04-14 00:51:29,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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-14 00:51:29,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:29,204 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:29,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 00:51:29,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:51:29,405 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:29,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1013177831, now seen corresponding path program 24 times [2025-04-14 00:51:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:29,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799088071] [2025-04-14 00:51:29,406 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:51:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:29,407 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:51:29,412 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:51:29,412 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:51:29,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:29,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799088071] [2025-04-14 00:51:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799088071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:51:29,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476561136] [2025-04-14 00:51:29,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:51:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:51:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:51:29,664 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:51:29,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 00:51:29,692 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:51:29,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:51:29,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:51:29,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:29,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:51:29,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:51:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:29,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:51:34,399 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x_1~0 4294967296)) (.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296))) (let ((.cse3 (+ .cse4 .cse5)) (.cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (.cse1 (+ .cse4 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296))) (.cse2 (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (and (or (forall ((v_z_356 Int)) (or (< v_z_356 .cse0) (< .cse1 (+ (mod (+ c_~x_2~0 (* 2 v_z_356)) 4294967296) 1)) (< .cse2 v_z_356))) (< 4294967294 .cse3)) (forall ((v_z_356 Int)) (or (< (mod (+ c_~x_2~0 (* 2 v_z_356)) 4294967296) (+ .cse4 2 .cse5)) (< v_z_356 .cse0) (< .cse2 v_z_356))) (or (< .cse1 4294967296) (forall ((v_z_356 Int)) (or (< v_z_356 .cse0) (< .cse2 v_z_356) (< (+ (mod (+ c_~x_2~0 (* 2 v_z_356)) 4294967296) 4294967294) .cse3)))) (forall ((v_z_356 Int)) (or (< v_z_356 .cse0) (< .cse1 (+ (mod (+ c_~x_2~0 (* 2 v_z_356)) 4294967296) 4294967297)) (< .cse2 v_z_356)))))) is different from false [2025-04-14 00:52:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-14 00:52:27,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476561136] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:52:27,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:52:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-14 00:52:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593660535] [2025-04-14 00:52:27,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:52:27,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 00:52:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:27,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 00:52:27,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=263, Unknown=14, NotChecked=34, Total=380 [2025-04-14 00:52:27,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:52:27,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 356 transitions, 4768 flow. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 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-14 00:52:27,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:27,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:52:27,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:53,108 INFO L116 PetriNetUnfolderBase]: 708/1356 cut-off events. [2025-04-14 00:52:53,108 INFO L117 PetriNetUnfolderBase]: For 22042/22042 co-relation queries the response was YES. [2025-04-14 00:52:53,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10252 conditions, 1356 events. 708/1356 cut-off events. For 22042/22042 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 8215 event pairs, 57 based on Foata normal form. 2/1338 useless extension candidates. Maximal degree in co-relation 10083. Up to 1236 conditions per place. [2025-04-14 00:52:53,120 INFO L140 encePairwiseOnDemand]: 9/17 looper letters, 336 selfloop transitions, 53 changer transitions 8/397 dead transitions. [2025-04-14 00:52:53,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 397 transitions, 5903 flow [2025-04-14 00:52:53,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:52:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:52:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2025-04-14 00:52:53,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-04-14 00:52:53,121 INFO L175 Difference]: Start difference. First operand has 334 places, 356 transitions, 4768 flow. Second operand 20 states and 125 transitions. [2025-04-14 00:52:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 397 transitions, 5903 flow [2025-04-14 00:52:53,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 397 transitions, 5685 flow, removed 63 selfloop flow, removed 21 redundant places. [2025-04-14 00:52:53,253 INFO L231 Difference]: Finished difference. Result has 336 places, 364 transitions, 4902 flow [2025-04-14 00:52:53,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4902, PETRI_PLACES=336, PETRI_TRANSITIONS=364} [2025-04-14 00:52:53,253 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 317 predicate places. [2025-04-14 00:52:53,253 INFO L485 AbstractCegarLoop]: Abstraction has has 336 places, 364 transitions, 4902 flow [2025-04-14 00:52:53,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 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-14 00:52:53,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:53,253 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:53,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-14 00:52:53,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-14 00:52:53,458 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:53,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1760357542, now seen corresponding path program 4 times [2025-04-14 00:52:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:53,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655923481] [2025-04-14 00:52:53,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:52:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:53,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:52:53,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:52:53,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:52:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:53,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:53,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655923481] [2025-04-14 00:52:53,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655923481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:53,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090046426] [2025-04-14 00:52:53,607 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:52:53,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:53,609 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:52:53,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 00:52:53,631 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 00:52:53,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:52:53,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:52:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:52:53,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:57,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:10,059 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse7 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse0 (+ .cse4 v_z_362)) (.cse2 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)))) (or (< .cse0 4294967296) (< 4294967295 v_z_362) (= .cse1 .cse0) (< .cse2 0) (< .cse3 .cse2)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse6 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362))) (.cse5 (+ .cse4 v_z_362))) (or (< v_z_362 0) (< 4294967295 .cse5) (< .cse6 0) (< .cse3 .cse6) (= .cse7 .cse5)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse9 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362))) (.cse8 (+ .cse4 v_z_362))) (or (< v_z_362 0) (< 4294967295 v_z_362) (= .cse1 .cse8) (< .cse9 0) (< .cse3 .cse9) (= .cse7 .cse8))))))) is different from false [2025-04-14 00:53:22,145 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:53:42,178 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:53:54,351 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse0 (+ .cse2 v_z_362))) (or (< v_z_362 0) (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse4 (+ .cse2 v_z_362))) (or (< v_z_362 0) (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< 4294967295 v_z_362) (= .cse3 .cse4) (= .cse1 .cse4)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse5 (+ .cse2 v_z_362))) (or (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< .cse5 4294967296) (< 4294967295 v_z_362) (= .cse3 .cse5))))))) is different from false [2025-04-14 00:54:12,626 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:54:37,701 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:55:01,972 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:55:29,431 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:55:49,689 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:56:09,725 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:56:29,783 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:56:49,818 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:57:01,838 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:57:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-14 00:57:01,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090046426] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:57:01,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:57:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-14 00:57:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547537353] [2025-04-14 00:57:01,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:57:01,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:57:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:57:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=131, Unknown=5, NotChecked=50, Total=240 [2025-04-14 00:57:01,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 00:57:01,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 364 transitions, 4902 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:01,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:01,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 00:57:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:06,061 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse0 (+ .cse2 v_z_362))) (or (< v_z_362 0) (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse4 (+ .cse2 v_z_362))) (or (< v_z_362 0) (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< 4294967295 v_z_362) (= .cse3 .cse4) (= .cse1 .cse4)))) (= c_~x_2~0 0) (= c_~x_1~0 0) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse5 (+ .cse2 v_z_362))) (or (not (= (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)) 0)) (< .cse5 4294967296) (< 4294967295 v_z_362) (= .cse3 .cse5))))))) is different from false [2025-04-14 00:57:10,089 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse7 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse0 (+ .cse4 v_z_362)) (.cse2 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362)))) (or (< .cse0 4294967296) (< 4294967295 v_z_362) (= .cse1 .cse0) (< .cse2 0) (< .cse3 .cse2)))) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse6 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362))) (.cse5 (+ .cse4 v_z_362))) (or (< v_z_362 0) (< 4294967295 .cse5) (< .cse6 0) (< .cse3 .cse6) (= .cse7 .cse5)))) (= c_thread1Thread1of1ForFork1_~i~0 0) (forall ((v_z_362 Int) (v_y_362 Int)) (let ((.cse9 (+ (* v_y_362 4294967296) (* 2863311531 v_z_362))) (.cse8 (+ .cse4 v_z_362))) (or (< v_z_362 0) (< 4294967295 v_z_362) (= .cse1 .cse8) (< .cse9 0) (< .cse3 .cse9) (= .cse7 .cse8)))) (= c_~x_1~0 0)))) is different from false [2025-04-14 00:57:10,739 INFO L116 PetriNetUnfolderBase]: 767/1464 cut-off events. [2025-04-14 00:57:10,739 INFO L117 PetriNetUnfolderBase]: For 26934/26934 co-relation queries the response was YES. [2025-04-14 00:57:10,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11697 conditions, 1464 events. 767/1464 cut-off events. For 26934/26934 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 8923 event pairs, 66 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 11527. Up to 1357 conditions per place. [2025-04-14 00:57:10,750 INFO L140 encePairwiseOnDemand]: 7/17 looper letters, 386 selfloop transitions, 26 changer transitions 4/416 dead transitions. [2025-04-14 00:57:10,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 416 transitions, 6736 flow [2025-04-14 00:57:10,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:57:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:57:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2025-04-14 00:57:10,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 00:57:10,751 INFO L175 Difference]: Start difference. First operand has 336 places, 364 transitions, 4902 flow. Second operand 11 states and 85 transitions. [2025-04-14 00:57:10,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 416 transitions, 6736 flow [2025-04-14 00:57:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 416 transitions, 6590 flow, removed 42 selfloop flow, removed 14 redundant places. [2025-04-14 00:57:10,890 INFO L231 Difference]: Finished difference. Result has 336 places, 388 transitions, 5549 flow [2025-04-14 00:57:10,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=4779, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5549, PETRI_PLACES=336, PETRI_TRANSITIONS=388} [2025-04-14 00:57:10,891 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 317 predicate places. [2025-04-14 00:57:10,891 INFO L485 AbstractCegarLoop]: Abstraction has has 336 places, 388 transitions, 5549 flow [2025-04-14 00:57:10,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:10,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:10,891 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:57:10,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-14 00:57:11,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-14 00:57:11,092 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:57:11,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1933735552, now seen corresponding path program 5 times [2025-04-14 00:57:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:11,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754958933] [2025-04-14 00:57:11,092 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:11,094 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-14 00:57:11,098 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:57:11,098 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:57:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:11,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754958933] [2025-04-14 00:57:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754958933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:11,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496447249] [2025-04-14 00:57:11,208 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:11,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:11,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:57:11,212 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:57:11,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-14 00:57:11,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-14 00:57:11,258 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:57:11,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 00:57:11,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:11,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:57:11,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:57:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:15,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:57:27,925 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse2 4294967296)) (.cse4 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse0 (+ .cse5 v_z_365)) (.cse3 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (= .cse0 .cse1) (= .cse0 .cse2) (< 4294967295 v_z_365) (< v_z_365 0) (< .cse3 0) (< .cse4 .cse3)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse6 (+ .cse5 v_z_365)) (.cse7 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (= .cse6 .cse1) (< .cse6 4294967296) (< 4294967295 v_z_365) (< .cse7 0) (< .cse4 .cse7)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse8 (+ .cse5 v_z_365)) (.cse9 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (< 4294967295 .cse8) (= .cse8 .cse2) (< v_z_365 0) (< .cse9 0) (< .cse4 .cse9))))))) is different from false [2025-04-14 00:57:48,131 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:58:12,183 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:58:16,395 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse0 (+ .cse3 v_z_365))) (or (= .cse0 .cse1) (= .cse0 .cse2) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< 4294967295 v_z_365) (< v_z_365 0)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse4 (+ .cse3 v_z_365))) (or (= .cse4 .cse1) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< .cse4 4294967296) (< 4294967295 v_z_365)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse5 (+ .cse3 v_z_365))) (or (< 4294967295 .cse5) (= .cse5 .cse2) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< v_z_365 0))))))) is different from false [2025-04-14 00:58:53,690 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:59:33,846 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:59:46,074 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:00:18,165 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:00:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-14 01:00:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496447249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:00:18,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:00:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-14 01:00:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337951933] [2025-04-14 01:00:18,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:00:18,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:00:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:18,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:00:18,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2025-04-14 01:00:18,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2025-04-14 01:00:18,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 388 transitions, 5549 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:18,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:18,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2025-04-14 01:00:18,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:00:22,202 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse2 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse0 (+ .cse3 v_z_365))) (or (= .cse0 .cse1) (= .cse0 .cse2) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< 4294967295 v_z_365) (< v_z_365 0)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse4 (+ .cse3 v_z_365))) (or (= .cse4 .cse1) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< .cse4 4294967296) (< 4294967295 v_z_365)))) (= c_~x_1~0 0) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse5 (+ .cse3 v_z_365))) (or (< 4294967295 .cse5) (= .cse5 .cse2) (not (= (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)) 0)) (< v_z_365 0))))))) is different from false [2025-04-14 01:00:26,337 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse1 (+ .cse2 4294967296)) (.cse4 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse0 (+ .cse5 v_z_365)) (.cse3 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (= .cse0 .cse1) (= .cse0 .cse2) (< 4294967295 v_z_365) (< v_z_365 0) (< .cse3 0) (< .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse6 (+ .cse5 v_z_365)) (.cse7 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (= .cse6 .cse1) (< .cse6 4294967296) (< 4294967295 v_z_365) (< .cse7 0) (< .cse4 .cse7)))) (forall ((v_z_365 Int) (v_y_365 Int)) (let ((.cse8 (+ .cse5 v_z_365)) (.cse9 (+ (* 2863311531 v_z_365) (* v_y_365 4294967296)))) (or (< 4294967295 .cse8) (= .cse8 .cse2) (< v_z_365 0) (< .cse9 0) (< .cse4 .cse9)))) (= c_thread1Thread1of1ForFork1_~i~0 0) (= c_~x_1~0 0)))) is different from false [2025-04-14 01:00:26,990 INFO L116 PetriNetUnfolderBase]: 818/1584 cut-off events. [2025-04-14 01:00:26,990 INFO L117 PetriNetUnfolderBase]: For 37792/37792 co-relation queries the response was YES. [2025-04-14 01:00:27,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13838 conditions, 1584 events. 818/1584 cut-off events. For 37792/37792 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9998 event pairs, 268 based on Foata normal form. 2/1566 useless extension candidates. Maximal degree in co-relation 13661. Up to 1426 conditions per place. [2025-04-14 01:00:27,004 INFO L140 encePairwiseOnDemand]: 7/17 looper letters, 410 selfloop transitions, 46 changer transitions 4/460 dead transitions. [2025-04-14 01:00:27,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 460 transitions, 8221 flow [2025-04-14 01:00:27,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:00:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:00:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2025-04-14 01:00:27,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 01:00:27,005 INFO L175 Difference]: Start difference. First operand has 336 places, 388 transitions, 5549 flow. Second operand 11 states and 85 transitions. [2025-04-14 01:00:27,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 460 transitions, 8221 flow [2025-04-14 01:00:27,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 460 transitions, 7756 flow, removed 230 selfloop flow, removed 1 redundant places. [2025-04-14 01:00:27,216 INFO L231 Difference]: Finished difference. Result has 354 places, 432 transitions, 6705 flow [2025-04-14 01:00:27,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=5316, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6705, PETRI_PLACES=354, PETRI_TRANSITIONS=432} [2025-04-14 01:00:27,216 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 335 predicate places. [2025-04-14 01:00:27,216 INFO L485 AbstractCegarLoop]: Abstraction has has 354 places, 432 transitions, 6705 flow [2025-04-14 01:00:27,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:00:27,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:27,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:27,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-14 01:00:27,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-14 01:00:27,417 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:00:27,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1763895086, now seen corresponding path program 6 times [2025-04-14 01:00:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:27,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099827779] [2025-04-14 01:00:27,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:00:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:27,420 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-14 01:00:27,424 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:00:27,424 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:00:27,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:27,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099827779] [2025-04-14 01:00:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099827779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:00:27,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559766129] [2025-04-14 01:00:27,519 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:00:27,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:00:27,521 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:00:27,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-14 01:00:27,543 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-14 01:00:27,581 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:00:27,581 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:00:27,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:27,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:00:27,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:00:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:31,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:00:43,933 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x_1~0 4294967296))) (let ((.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse2 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse3 (+ .cse5 v_z_368)) (.cse1 (+ (* v_y_368 4294967296) (* 2863311531 v_z_368)))) (or (< v_z_368 0) (< 4294967295 v_z_368) (< .cse0 .cse1) (= .cse2 .cse3) (= .cse4 .cse3) (< .cse1 0)))) (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse6 (+ .cse5 v_z_368)) (.cse7 (+ (* v_y_368 4294967296) (* 2863311531 v_z_368)))) (or (< v_z_368 0) (< 4294967295 .cse6) (< .cse0 .cse7) (= .cse4 .cse6) (< .cse7 0)))) (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse8 (+ (* v_y_368 4294967296) (* 2863311531 v_z_368))) (.cse9 (+ .cse5 v_z_368))) (or (< 4294967295 v_z_368) (< .cse0 .cse8) (= .cse2 .cse9) (< .cse8 0) (< .cse9 4294967296))))))) is different from false [2025-04-14 01:01:08,535 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:01:24,776 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse0 (+ .cse2 v_z_368))) (or (< v_z_368 0) (< 4294967295 .cse0) (= .cse1 .cse0) (not (= (+ (* v_y_368 4294967296) (* 2863311531 v_z_368)) 0))))) (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse4 (+ .cse2 v_z_368))) (or (< 4294967295 v_z_368) (= .cse3 .cse4) (not (= (+ (* v_y_368 4294967296) (* 2863311531 v_z_368)) 0)) (< .cse4 4294967296)))) (forall ((v_z_368 Int) (v_y_368 Int)) (let ((.cse5 (+ .cse2 v_z_368))) (or (< v_z_368 0) (< 4294967295 v_z_368) (= .cse3 .cse5) (= .cse1 .cse5) (not (= (+ (* v_y_368 4294967296) (* 2863311531 v_z_368)) 0)))))))) is different from false [2025-04-14 01:01:56,856 WARN L286 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-14 01:02:15,332 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:02:15,334 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:02:16,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-14 01:02:16,533 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:02:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 01:02:16,565 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:02:16,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 01:02:16,565 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2025-04-14 01:02:16,566 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:02:16,566 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:02:16,567 INFO L422 BasicCegarLoop]: Path program histogram: [24, 6, 6, 1] [2025-04-14 01:02:16,569 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:02:16,569 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:02:16,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:02:16 BasicIcfg [2025-04-14 01:02:16,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:02:16,573 INFO L158 Benchmark]: Toolchain (without parser) took 876310.82ms. Allocated memory was 142.6MB in the beginning and 239.1MB in the end (delta: 96.5MB). Free memory was 100.2MB in the beginning and 122.1MB in the end (delta: -21.9MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. [2025-04-14 01:02:16,573 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:02:16,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.96ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:02:16,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.70ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:02:16,575 INFO L158 Benchmark]: Boogie Preprocessor took 33.48ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:02:16,575 INFO L158 Benchmark]: IcfgBuilder took 388.18ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 61.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:02:16,575 INFO L158 Benchmark]: TraceAbstraction took 875417.11ms. Allocated memory was 142.6MB in the beginning and 239.1MB in the end (delta: 96.5MB). Free memory was 60.7MB in the beginning and 122.1MB in the end (delta: -61.4MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2025-04-14 01:02:16,576 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 442.96ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.70ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.48ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 388.18ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 61.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 875417.11ms. Allocated memory was 142.6MB in the beginning and 239.1MB in the end (delta: 96.5MB). Free memory was 60.7MB in the beginning and 122.1MB in the end (delta: -61.4MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 16 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 875.3s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 183.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 1542 SdHoareTripleChecker+Valid, 120.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1542 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 118.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 608 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13961 IncrementalHoareTripleChecker+Invalid, 15142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 0 mSDtfsCounter, 13961 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1389 GetRequests, 593 SyntacticMatches, 28 SemanticMatches, 768 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 4974 ImplicationChecksByTransitivity, 214.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6705occurred in iteration=36, InterpolantAutomatonStates: 641, 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, 1.4s SatisfiabilityAnalysisTime, 573.0s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 1388 ConstructedInterpolants, 22 QuantifiedInterpolants, 25734 SizeOfPredicates, 128 NumberOfNonLiveVariables, 3345 ConjunctsInSsa, 675 ConjunctsInUnsatCore, 106 InterpolantComputations, 1 PerfectInterpolantSequences, 1/279 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