/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:45:33,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:45:33,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:45:33,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:45:33,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:45:33,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:45:33,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:45:33,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:45:33,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:45:33,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:45:33,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:45:33,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:45:33,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:45:33,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:45:33,934 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:45:33,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:45:33,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:33,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:33,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:33,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:45:33,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:45:34,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:45:34,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:45:34,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:45:34,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:45:34,193 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:45:34,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-13 19:45:35,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbc32b79/a48ab88aa5644bda81690cc1d514fcff/FLAG4b61c351c [2025-04-13 19:45:35,700 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:45:35,701 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-13 19:45:35,708 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbc32b79/a48ab88aa5644bda81690cc1d514fcff/FLAG4b61c351c [2025-04-13 19:45:36,547 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbc32b79/a48ab88aa5644bda81690cc1d514fcff [2025-04-13 19:45:36,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:45:36,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:45:36,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:36,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:45:36,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:45:36,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2c56fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36, skipping insertion in model container [2025-04-13 19:45:36,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:45:36,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2025-04-13 19:45:36,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:36,733 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:45:36,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2025-04-13 19:45:36,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:36,762 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:45:36,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36 WrapperNode [2025-04-13 19:45:36,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:36,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:36,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:45:36,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:45:36,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,787 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-04-13 19:45:36,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:36,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:45:36,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:45:36,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:45:36,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,805 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:45:36,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:45:36,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:45:36,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:45:36,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:45:36,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (1/1) ... [2025-04-13 19:45:36,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:36,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:45:36,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:45:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:45:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:45:36,866 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:45:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:45:36,866 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:45:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:45:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:45:36,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:45:36,867 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:45:36,917 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:45:36,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:45:37,005 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:45:37,006 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:45:37,006 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:45:37,132 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:45:37,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:37 BoogieIcfgContainer [2025-04-13 19:45:37,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:45:37,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:45:37,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:45:37,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:45:37,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:45:36" (1/3) ... [2025-04-13 19:45:37,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bfed99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:37, skipping insertion in model container [2025-04-13 19:45:37,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:36" (2/3) ... [2025-04-13 19:45:37,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bfed99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:37, skipping insertion in model container [2025-04-13 19:45:37,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:37" (3/3) ... [2025-04-13 19:45:37,142 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2025-04-13 19:45:37,152 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:45:37,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp1x3.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:45:37,154 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:45:37,192 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:45:37,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 19:45:37,241 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-13 19:45:37,243 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:45:37,244 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 3. Compared 11 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-13 19:45:37,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 19:45:37,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-13 19:45:37,257 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:45:37,267 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;@6914d5fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:45:37,267 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:45:37,273 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:45:37,273 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-13 19:45:37,274 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:45:37,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:37,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:37,274 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-13 19:45:37,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1290036706, now seen corresponding path program 1 times [2025-04-13 19:45:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:37,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131174704] [2025-04-13 19:45:37,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:37,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:45:37,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:45:37,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:37,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:37,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131174704] [2025-04-13 19:45:37,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131174704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:37,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:37,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:45:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096394357] [2025-04-13 19:45:37,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:37,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:45:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:37,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:45:37,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:45:37,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:45:37,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:37,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:37,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:45:37,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:37,562 INFO L116 PetriNetUnfolderBase]: 59/103 cut-off events. [2025-04-13 19:45:37,562 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-13 19:45:37,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 103 events. 59/103 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 8 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-04-13 19:45:37,564 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 17 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2025-04-13 19:45:37,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 109 flow [2025-04-13 19:45:37,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:45:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:45:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 19:45:37,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 19:45:37,574 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 34 transitions. [2025-04-13 19:45:37,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 109 flow [2025-04-13 19:45:37,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:45:37,582 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-13 19:45:37,584 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-13 19:45:37,588 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-13 19:45:37,589 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-13 19:45:37,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:37,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:37,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:37,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:45:37,591 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-13 19:45:37,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -412861566, now seen corresponding path program 1 times [2025-04-13 19:45:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:37,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563655408] [2025-04-13 19:45:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:37,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:45:37,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:37,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:37,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:37,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563655408] [2025-04-13 19:45:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563655408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207741979] [2025-04-13 19:45:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:37,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:37,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:37,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:37,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:45:37,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:37,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:37,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:45:37,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:37,800 INFO L116 PetriNetUnfolderBase]: 57/100 cut-off events. [2025-04-13 19:45:37,800 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 19:45:37,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 100 events. 57/100 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 257 event pairs, 1 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 72. Up to 38 conditions per place. [2025-04-13 19:45:37,801 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 22 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2025-04-13 19:45:37,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 34 transitions, 161 flow [2025-04-13 19:45:37,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-13 19:45:37,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-04-13 19:45:37,802 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 5 states and 53 transitions. [2025-04-13 19:45:37,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 34 transitions, 161 flow [2025-04-13 19:45:37,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:37,803 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 72 flow [2025-04-13 19:45:37,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2025-04-13 19:45:37,804 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 3 predicate places. [2025-04-13 19:45:37,804 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 72 flow [2025-04-13 19:45:37,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:37,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:37,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:37,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:45:37,804 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-13 19:45:37,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1314174326, now seen corresponding path program 2 times [2025-04-13 19:45:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:37,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109884862] [2025-04-13 19:45:37,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:37,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:45:37,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:37,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:37,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109884862] [2025-04-13 19:45:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109884862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:37,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660931107] [2025-04-13 19:45:37,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:37,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:37,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:45:37,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:45:37,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:45:37,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:37,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:37,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:37,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:37,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660931107] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:38,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903796583] [2025-04-13 19:45:38,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:38,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:38,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:38,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:45:38,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:38,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:45:38,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:38,226 INFO L116 PetriNetUnfolderBase]: 49/91 cut-off events. [2025-04-13 19:45:38,227 INFO L117 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-04-13 19:45:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 91 events. 49/91 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 242 event pairs, 5 based on Foata normal form. 5/93 useless extension candidates. Maximal degree in co-relation 64. Up to 51 conditions per place. [2025-04-13 19:45:38,227 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 22 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2025-04-13 19:45:38,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 179 flow [2025-04-13 19:45:38,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-04-13 19:45:38,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2025-04-13 19:45:38,229 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 72 flow. Second operand 5 states and 52 transitions. [2025-04-13 19:45:38,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 179 flow [2025-04-13 19:45:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 33 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:38,230 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 107 flow [2025-04-13 19:45:38,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-04-13 19:45:38,230 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 8 predicate places. [2025-04-13 19:45:38,230 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 107 flow [2025-04-13 19:45:38,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:38,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:38,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:45:38,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:38,431 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-13 19:45:38,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1336466919, now seen corresponding path program 1 times [2025-04-13 19:45:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:38,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595761074] [2025-04-13 19:45:38,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:45:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:38,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595761074] [2025-04-13 19:45:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595761074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:38,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140607546] [2025-04-13 19:45:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:38,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:38,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:38,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:38,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:45:38,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:38,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:45:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:38,584 INFO L116 PetriNetUnfolderBase]: 46/87 cut-off events. [2025-04-13 19:45:38,584 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-13 19:45:38,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 87 events. 46/87 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 220 event pairs, 1 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 170. Up to 46 conditions per place. [2025-04-13 19:45:38,585 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 4 changer transitions 7/33 dead transitions. [2025-04-13 19:45:38,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 205 flow [2025-04-13 19:45:38,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-04-13 19:45:38,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2025-04-13 19:45:38,591 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 107 flow. Second operand 5 states and 49 transitions. [2025-04-13 19:45:38,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 205 flow [2025-04-13 19:45:38,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:38,593 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 98 flow [2025-04-13 19:45:38,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2025-04-13 19:45:38,593 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2025-04-13 19:45:38,593 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 98 flow [2025-04-13 19:45:38,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:38,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:38,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:45:38,594 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-13 19:45:38,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1120631169, now seen corresponding path program 2 times [2025-04-13 19:45:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:38,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205702253] [2025-04-13 19:45:38,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:38,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:45:38,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:38,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:38,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205702253] [2025-04-13 19:45:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205702253] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:38,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153662312] [2025-04-13 19:45:38,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:45:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:38,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:45:38,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:45:38,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:45:38,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:45:38,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:45:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:38,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:45:38,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153662312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:38,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 19:45:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315852257] [2025-04-13 19:45:38,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:38,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:45:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:38,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:45:38,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:45:38,810 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:45:38,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:38,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:45:38,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:38,880 INFO L116 PetriNetUnfolderBase]: 37/69 cut-off events. [2025-04-13 19:45:38,880 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-13 19:45:38,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 69 events. 37/69 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 2 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 127. Up to 55 conditions per place. [2025-04-13 19:45:38,881 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2025-04-13 19:45:38,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 185 flow [2025-04-13 19:45:38,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2025-04-13 19:45:38,884 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-04-13 19:45:38,884 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 98 flow. Second operand 5 states and 45 transitions. [2025-04-13 19:45:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 185 flow [2025-04-13 19:45:38,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 173 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 19:45:38,885 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 129 flow [2025-04-13 19:45:38,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2025-04-13 19:45:38,886 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 13 predicate places. [2025-04-13 19:45:38,886 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 129 flow [2025-04-13 19:45:38,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:38,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:38,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:38,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:45:39,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:39,090 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-13 19:45:39,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1930794407, now seen corresponding path program 1 times [2025-04-13 19:45:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:39,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070704605] [2025-04-13 19:45:39,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:39,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:45:39,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:45:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:39,410 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-13 19:45:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:39,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070704605] [2025-04-13 19:45:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070704605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:39,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663316597] [2025-04-13 19:45:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:39,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:45:39,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:45:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:45:39,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:45:39,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:39,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:39,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 19:45:39,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:46:33,362 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:46:41,876 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-13 19:46:41,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:47:10,542 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-13 19:47:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663316597] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:47:10,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:47:10,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 19:47:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619413616] [2025-04-13 19:47:10,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:47:10,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:47:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:47:10,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:47:10,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=146, Unknown=14, NotChecked=0, Total=210 [2025-04-13 19:47:10,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:47:10,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 129 flow. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:47:10,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:47:10,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:47:10,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:47:33,873 WARN L286 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 46 DAG size of output: 39 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:47:38,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:47:42,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:47:43,912 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:47:48,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:47:52,953 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:47:54,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:48:06,184 INFO L116 PetriNetUnfolderBase]: 125/235 cut-off events. [2025-04-13 19:48:06,185 INFO L117 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-04-13 19:48:06,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 235 events. 125/235 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 822 event pairs, 6 based on Foata normal form. 6/240 useless extension candidates. Maximal degree in co-relation 548. Up to 85 conditions per place. [2025-04-13 19:48:06,186 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 49 selfloop transitions, 25 changer transitions 14/90 dead transitions. [2025-04-13 19:48:06,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 90 transitions, 649 flow [2025-04-13 19:48:06,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:48:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:48:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2025-04-13 19:48:06,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6108597285067874 [2025-04-13 19:48:06,190 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 129 flow. Second operand 13 states and 135 transitions. [2025-04-13 19:48:06,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 90 transitions, 649 flow [2025-04-13 19:48:06,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 634 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:48:06,196 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 381 flow [2025-04-13 19:48:06,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=381, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-04-13 19:48:06,197 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 31 predicate places. [2025-04-13 19:48:06,197 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 381 flow [2025-04-13 19:48:06,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:06,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:48:06,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:48:06,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:48:06,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:06,398 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-13 19:48:06,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:48:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -415845291, now seen corresponding path program 2 times [2025-04-13 19:48:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:48:06,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946002668] [2025-04-13 19:48:06,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:48:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:48:06,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:48:06,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:48:06,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:48:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:06,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-13 19:48:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:48:06,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946002668] [2025-04-13 19:48:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946002668] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:48:06,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523254918] [2025-04-13 19:48:06,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:48:06,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:06,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:48:06,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:48:06,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:48:06,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:48:06,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:48:06,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:48:06,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:06,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:48:06,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:07,219 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-13 19:48:07,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:48:07,456 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-13 19:48:07,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523254918] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:48:07,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:48:07,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 19:48:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267759531] [2025-04-13 19:48:07,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:48:07,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:48:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:48:07,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:48:07,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:48:07,458 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:48:07,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 381 flow. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:07,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:48:07,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:48:07,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:48:09,962 INFO L116 PetriNetUnfolderBase]: 221/432 cut-off events. [2025-04-13 19:48:09,962 INFO L117 PetriNetUnfolderBase]: For 2336/2336 co-relation queries the response was YES. [2025-04-13 19:48:09,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 432 events. 221/432 cut-off events. For 2336/2336 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1931 event pairs, 12 based on Foata normal form. 8/439 useless extension candidates. Maximal degree in co-relation 2240. Up to 189 conditions per place. [2025-04-13 19:48:09,965 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 73 selfloop transitions, 42 changer transitions 19/136 dead transitions. [2025-04-13 19:48:09,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 136 transitions, 1357 flow [2025-04-13 19:48:09,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 19:48:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 19:48:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 177 transitions. [2025-04-13 19:48:09,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-04-13 19:48:09,967 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 381 flow. Second operand 18 states and 177 transitions. [2025-04-13 19:48:09,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 136 transitions, 1357 flow [2025-04-13 19:48:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 136 transitions, 1224 flow, removed 65 selfloop flow, removed 2 redundant places. [2025-04-13 19:48:09,973 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 772 flow [2025-04-13 19:48:09,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=772, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-04-13 19:48:09,974 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 57 predicate places. [2025-04-13 19:48:09,974 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 772 flow [2025-04-13 19:48:09,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:09,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:48:09,974 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:48:09,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:48:10,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:10,175 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-13 19:48:10,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:48:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1088832726, now seen corresponding path program 3 times [2025-04-13 19:48:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:48:10,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714393101] [2025-04-13 19:48:10,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:48:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:48:10,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:10,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:10,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:48:10,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:48:10,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714393101] [2025-04-13 19:48:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714393101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:48:10,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097638155] [2025-04-13 19:48:10,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:48:10,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:10,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:48:10,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:48:10,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:48:10,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:10,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:10,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:48:10,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:10,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:48:10,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:12,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:48:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097638155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:48:12,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:48:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2025-04-13 19:48:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787747089] [2025-04-13 19:48:12,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:48:12,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:48:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:48:12,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:48:12,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:48:12,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:48:12,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 772 flow. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:12,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:48:12,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:48:12,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:48:16,898 INFO L116 PetriNetUnfolderBase]: 407/719 cut-off events. [2025-04-13 19:48:16,898 INFO L117 PetriNetUnfolderBase]: For 10116/10116 co-relation queries the response was YES. [2025-04-13 19:48:16,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 719 events. 407/719 cut-off events. For 10116/10116 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3187 event pairs, 2 based on Foata normal form. 32/750 useless extension candidates. Maximal degree in co-relation 4428. Up to 247 conditions per place. [2025-04-13 19:48:16,904 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 106 selfloop transitions, 78 changer transitions 43/229 dead transitions. [2025-04-13 19:48:16,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 229 transitions, 2760 flow [2025-04-13 19:48:16,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:48:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:48:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 217 transitions. [2025-04-13 19:48:16,921 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5802139037433155 [2025-04-13 19:48:16,921 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 772 flow. Second operand 22 states and 217 transitions. [2025-04-13 19:48:16,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 229 transitions, 2760 flow [2025-04-13 19:48:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 229 transitions, 2459 flow, removed 137 selfloop flow, removed 6 redundant places. [2025-04-13 19:48:16,941 INFO L231 Difference]: Finished difference. Result has 98 places, 126 transitions, 1347 flow [2025-04-13 19:48:16,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1347, PETRI_PLACES=98, PETRI_TRANSITIONS=126} [2025-04-13 19:48:16,942 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 79 predicate places. [2025-04-13 19:48:16,942 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 126 transitions, 1347 flow [2025-04-13 19:48:16,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:16,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:48:16,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:48:16,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 19:48:17,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:17,143 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-13 19:48:17,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:48:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1038783846, now seen corresponding path program 4 times [2025-04-13 19:48:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:48:17,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429719034] [2025-04-13 19:48:17,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:48:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:48:17,146 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:17,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:17,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:48:17,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:17,228 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-13 19:48:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:48:17,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429719034] [2025-04-13 19:48:17,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429719034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:48:17,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962295128] [2025-04-13 19:48:17,229 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:48:17,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:17,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:48:17,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:48:17,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:48:17,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:17,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:17,268 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:48:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:17,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:48:17,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:21,896 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-13 19:48:21,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:48:22,322 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-13 19:48:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962295128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:48:22,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:48:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 19:48:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301369789] [2025-04-13 19:48:22,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:48:22,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:48:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:48:22,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:48:22,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:48:22,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:48:22,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 126 transitions, 1347 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:22,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:48:22,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:48:22,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:48:23,113 INFO L116 PetriNetUnfolderBase]: 312/559 cut-off events. [2025-04-13 19:48:23,114 INFO L117 PetriNetUnfolderBase]: For 6213/6213 co-relation queries the response was YES. [2025-04-13 19:48:23,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3394 conditions, 559 events. 312/559 cut-off events. For 6213/6213 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2324 event pairs, 13 based on Foata normal form. 20/578 useless extension candidates. Maximal degree in co-relation 3301. Up to 404 conditions per place. [2025-04-13 19:48:23,118 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 106 selfloop transitions, 42 changer transitions 0/150 dead transitions. [2025-04-13 19:48:23,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 1793 flow [2025-04-13 19:48:23,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:48:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:48:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2025-04-13 19:48:23,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5240641711229946 [2025-04-13 19:48:23,119 INFO L175 Difference]: Start difference. First operand has 98 places, 126 transitions, 1347 flow. Second operand 11 states and 98 transitions. [2025-04-13 19:48:23,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 1793 flow [2025-04-13 19:48:23,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 150 transitions, 1471 flow, removed 130 selfloop flow, removed 12 redundant places. [2025-04-13 19:48:23,135 INFO L231 Difference]: Finished difference. Result has 92 places, 126 transitions, 1203 flow [2025-04-13 19:48:23,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1203, PETRI_PLACES=92, PETRI_TRANSITIONS=126} [2025-04-13 19:48:23,136 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 73 predicate places. [2025-04-13 19:48:23,136 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 126 transitions, 1203 flow [2025-04-13 19:48:23,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:23,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:48:23,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:48:23,142 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-13 19:48:23,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:23,337 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-13 19:48:23,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:48:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1753600650, now seen corresponding path program 5 times [2025-04-13 19:48:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:48:23,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614605397] [2025-04-13 19:48:23,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:48:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:48:23,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:23,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:23,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:48:23,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:48:23,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614605397] [2025-04-13 19:48:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614605397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:48:23,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382850998] [2025-04-13 19:48:23,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:48:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:23,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:48:23,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:48:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:48:23,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:48:23,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:48:23,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:48:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:48:23,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:42,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:48:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:48:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382850998] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:48:47,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:48:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 19:48:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096117176] [2025-04-13 19:48:47,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:48:47,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 19:48:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:48:47,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 19:48:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=239, Unknown=2, NotChecked=0, Total=306 [2025-04-13 19:48:47,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:48:47,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 126 transitions, 1203 flow. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:48:47,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:48:47,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:48:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:01,463 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:49:04,145 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:49:08,148 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:49:23,189 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:49:38,474 WARN L286 SmtUtils]: Spent 13.94s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:50:03,963 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:05,543 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:25,377 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:29,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:33,396 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:36,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:50:52,950 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:13,885 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:18,306 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:36,339 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:51:39,110 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:01,184 INFO L116 PetriNetUnfolderBase]: 426/823 cut-off events. [2025-04-13 19:52:01,185 INFO L117 PetriNetUnfolderBase]: For 11377/11377 co-relation queries the response was YES. [2025-04-13 19:52:01,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4913 conditions, 823 events. 426/823 cut-off events. For 11377/11377 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4273 event pairs, 14 based on Foata normal form. 26/848 useless extension candidates. Maximal degree in co-relation 3513. Up to 481 conditions per place. [2025-04-13 19:52:01,190 INFO L140 encePairwiseOnDemand]: 10/17 looper letters, 159 selfloop transitions, 89 changer transitions 8/258 dead transitions. [2025-04-13 19:52:01,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 258 transitions, 3002 flow [2025-04-13 19:52:01,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 19:52:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 19:52:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 254 transitions. [2025-04-13 19:52:01,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5533769063180828 [2025-04-13 19:52:01,191 INFO L175 Difference]: Start difference. First operand has 92 places, 126 transitions, 1203 flow. Second operand 27 states and 254 transitions. [2025-04-13 19:52:01,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 258 transitions, 3002 flow [2025-04-13 19:52:01,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 258 transitions, 2811 flow, removed 78 selfloop flow, removed 7 redundant places. [2025-04-13 19:52:01,211 INFO L231 Difference]: Finished difference. Result has 126 places, 187 transitions, 2195 flow [2025-04-13 19:52:01,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2195, PETRI_PLACES=126, PETRI_TRANSITIONS=187} [2025-04-13 19:52:01,212 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 107 predicate places. [2025-04-13 19:52:01,212 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 187 transitions, 2195 flow [2025-04-13 19:52:01,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:52:01,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:01,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:52:01,220 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-13 19:52:01,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:01,413 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-13 19:52:01,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -802250395, now seen corresponding path program 6 times [2025-04-13 19:52:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:01,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607147797] [2025-04-13 19:52:01,414 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:52:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:01,417 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:52:01,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:52:01,421 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:52:01,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:01,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:01,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607147797] [2025-04-13 19:52:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607147797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:01,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2479511] [2025-04-13 19:52:01,498 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:52:01,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:01,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:01,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:52:01,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:52:01,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:52:01,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:52:01,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:52:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:01,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:52:01,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:52:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:01,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:52:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2479511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:52:01,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:52:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 19:52:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013911441] [2025-04-13 19:52:01,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:52:01,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:52:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:52:01,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:52:01,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:52:01,862 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:52:01,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 187 transitions, 2195 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:52:01,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:52:01,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:52:01,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:52:05,909 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:19,365 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:52:19,399 INFO L116 PetriNetUnfolderBase]: 428/823 cut-off events. [2025-04-13 19:52:19,399 INFO L117 PetriNetUnfolderBase]: For 19172/19172 co-relation queries the response was YES. [2025-04-13 19:52:19,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 823 events. 428/823 cut-off events. For 19172/19172 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4233 event pairs, 15 based on Foata normal form. 19/842 useless extension candidates. Maximal degree in co-relation 4595. Up to 397 conditions per place. [2025-04-13 19:52:19,405 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 197 selfloop transitions, 33 changer transitions 20/252 dead transitions. [2025-04-13 19:52:19,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 252 transitions, 3581 flow [2025-04-13 19:52:19,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:52:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:52:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2025-04-13 19:52:19,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:52:19,406 INFO L175 Difference]: Start difference. First operand has 126 places, 187 transitions, 2195 flow. Second operand 14 states and 119 transitions. [2025-04-13 19:52:19,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 252 transitions, 3581 flow [2025-04-13 19:52:19,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 252 transitions, 3065 flow, removed 244 selfloop flow, removed 6 redundant places. [2025-04-13 19:52:19,449 INFO L231 Difference]: Finished difference. Result has 140 places, 191 transitions, 2042 flow [2025-04-13 19:52:19,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1737, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2042, PETRI_PLACES=140, PETRI_TRANSITIONS=191} [2025-04-13 19:52:19,449 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 121 predicate places. [2025-04-13 19:52:19,449 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 191 transitions, 2042 flow [2025-04-13 19:52:19,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:52:19,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:52:19,449 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:52:19,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 19:52:19,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 19:52:19,650 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-13 19:52:19,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:52:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2010862504, now seen corresponding path program 7 times [2025-04-13 19:52:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:52:19,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538905405] [2025-04-13 19:52:19,651 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:52:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:52:19,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:52:19,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:52:19,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:52:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:52:20,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538905405] [2025-04-13 19:52:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538905405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:52:20,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074146683] [2025-04-13 19:52:20,436 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:52:20,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:52:20,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:52:20,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:52:20,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 19:52:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:52:20,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:52:20,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:52:20,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:52:20,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 19:52:20,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:13,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074146683] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:53:45,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:53:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 19:53:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816085228] [2025-04-13 19:53:45,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:53:45,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 19:53:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:45,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 19:53:45,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=275, Unknown=12, NotChecked=0, Total=342 [2025-04-13 19:53:45,415 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:53:45,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 191 transitions, 2042 flow. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:45,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:45,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:53:45,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:54:12,454 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:16,708 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:20,712 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:24,884 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:27,936 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:32,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:54:38,131 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:09,582 WARN L286 SmtUtils]: Spent 19.21s on a formula simplification. DAG size of input: 77 DAG size of output: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:55:12,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:14,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:18,929 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:25,021 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:29,040 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:32,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:36,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:41,469 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:45,544 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:50,570 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:55:52,245 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:43,151 WARN L286 SmtUtils]: Spent 40.65s on a formula simplification. DAG size of input: 53 DAG size of output: 50 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 19:56:47,426 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:53,907 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:56:54,951 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:12,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:22,220 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:23,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:27,488 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:29,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:37,374 INFO L116 PetriNetUnfolderBase]: 557/1090 cut-off events. [2025-04-13 19:57:37,374 INFO L117 PetriNetUnfolderBase]: For 30492/30492 co-relation queries the response was YES. [2025-04-13 19:57:37,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8065 conditions, 1090 events. 557/1090 cut-off events. For 30492/30492 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6257 event pairs, 9 based on Foata normal form. 9/1099 useless extension candidates. Maximal degree in co-relation 7726. Up to 524 conditions per place. [2025-04-13 19:57:37,382 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 171 selfloop transitions, 131 changer transitions 42/346 dead transitions. [2025-04-13 19:57:37,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 346 transitions, 4809 flow [2025-04-13 19:57:37,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:57:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:57:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 231 transitions. [2025-04-13 19:57:37,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2025-04-13 19:57:37,384 INFO L175 Difference]: Start difference. First operand has 140 places, 191 transitions, 2042 flow. Second operand 24 states and 231 transitions. [2025-04-13 19:57:37,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 346 transitions, 4809 flow [2025-04-13 19:57:37,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 346 transitions, 4441 flow, removed 162 selfloop flow, removed 7 redundant places. [2025-04-13 19:57:37,448 INFO L231 Difference]: Finished difference. Result has 164 places, 250 transitions, 3489 flow [2025-04-13 19:57:37,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3489, PETRI_PLACES=164, PETRI_TRANSITIONS=250} [2025-04-13 19:57:37,449 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 145 predicate places. [2025-04-13 19:57:37,449 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 250 transitions, 3489 flow [2025-04-13 19:57:37,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:37,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:57:37,449 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:57:37,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 19:57:37,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:37,650 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-13 19:57:37,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:57:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash -392638342, now seen corresponding path program 8 times [2025-04-13 19:57:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:57:37,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4730528] [2025-04-13 19:57:37,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:57:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:57:37,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:57:37,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:57:37,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:57:37,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:57:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:57:38,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4730528] [2025-04-13 19:57:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4730528] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:57:38,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743918893] [2025-04-13 19:57:38,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:57:38,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:57:38,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:57:38,330 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:57:38,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 19:57:38,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:57:38,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:57:38,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:57:38,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:57:38,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:57:38,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:57:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:57:48,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:57:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:57:49,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743918893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:57:49,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:57:49,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 19:57:49,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298035083] [2025-04-13 19:57:49,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:57:49,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 19:57:49,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:57:49,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 19:57:49,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2025-04-13 19:57:49,340 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:57:49,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 250 transitions, 3489 flow. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:57:49,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:57:49,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:57:49,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:57:51,622 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:53,863 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:57:57,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:02,135 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:24,105 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:30,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:32,404 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:34,691 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:37,804 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:40,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:42,874 INFO L116 PetriNetUnfolderBase]: 672/1338 cut-off events. [2025-04-13 19:58:42,874 INFO L117 PetriNetUnfolderBase]: For 46561/46561 co-relation queries the response was YES. [2025-04-13 19:58:42,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11588 conditions, 1338 events. 672/1338 cut-off events. For 46561/46561 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8195 event pairs, 14 based on Foata normal form. 11/1349 useless extension candidates. Maximal degree in co-relation 11223. Up to 817 conditions per place. [2025-04-13 19:58:42,884 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 281 selfloop transitions, 116 changer transitions 13/412 dead transitions. [2025-04-13 19:58:42,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 412 transitions, 7166 flow [2025-04-13 19:58:42,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:58:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:58:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 227 transitions. [2025-04-13 19:58:42,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.606951871657754 [2025-04-13 19:58:42,886 INFO L175 Difference]: Start difference. First operand has 164 places, 250 transitions, 3489 flow. Second operand 22 states and 227 transitions. [2025-04-13 19:58:42,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 412 transitions, 7166 flow [2025-04-13 19:58:43,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 412 transitions, 5679 flow, removed 737 selfloop flow, removed 7 redundant places. [2025-04-13 19:58:43,033 INFO L231 Difference]: Finished difference. Result has 186 places, 319 transitions, 4298 flow [2025-04-13 19:58:43,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4298, PETRI_PLACES=186, PETRI_TRANSITIONS=319} [2025-04-13 19:58:43,034 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 167 predicate places. [2025-04-13 19:58:43,034 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 319 transitions, 4298 flow [2025-04-13 19:58:43,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:43,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:43,034 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:43,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 19:58:43,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 19:58:43,235 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-13 19:58:43,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1617969599, now seen corresponding path program 9 times [2025-04-13 19:58:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:43,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032105141] [2025-04-13 19:58:43,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:58:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:43,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-04-13 19:58:43,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:58:43,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 19:58:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:43,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032105141] [2025-04-13 19:58:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032105141] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:43,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695629919] [2025-04-13 19:58:43,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:58:43,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:43,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:43,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:58:43,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:58:43,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-04-13 19:58:43,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:58:43,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 19:58:43,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:43,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:58:43,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:58:43,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:58:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695629919] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:44,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 19:58:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630892490] [2025-04-13 19:58:44,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:44,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:58:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:44,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:58:44,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:58:44,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-13 19:58:44,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 319 transitions, 4298 flow. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:44,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:44,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-13 19:58:44,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:45,646 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:49,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 19:58:50,135 INFO L116 PetriNetUnfolderBase]: 653/1293 cut-off events. [2025-04-13 19:58:50,136 INFO L117 PetriNetUnfolderBase]: For 22752/22752 co-relation queries the response was YES. [2025-04-13 19:58:50,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9811 conditions, 1293 events. 653/1293 cut-off events. For 22752/22752 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7798 event pairs, 30 based on Foata normal form. 11/1304 useless extension candidates. Maximal degree in co-relation 9468. Up to 1195 conditions per place. [2025-04-13 19:58:50,147 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 298 selfloop transitions, 30 changer transitions 0/330 dead transitions. [2025-04-13 19:58:50,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 330 transitions, 4964 flow [2025-04-13 19:58:50,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:58:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:58:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2025-04-13 19:58:50,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4919786096256685 [2025-04-13 19:58:50,148 INFO L175 Difference]: Start difference. First operand has 186 places, 319 transitions, 4298 flow. Second operand 11 states and 92 transitions. [2025-04-13 19:58:50,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 330 transitions, 4964 flow [2025-04-13 19:58:50,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 330 transitions, 4644 flow, removed 149 selfloop flow, removed 5 redundant places. [2025-04-13 19:58:50,256 INFO L231 Difference]: Finished difference. Result has 191 places, 313 transitions, 4000 flow [2025-04-13 19:58:50,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=3837, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4000, PETRI_PLACES=191, PETRI_TRANSITIONS=313} [2025-04-13 19:58:50,257 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 172 predicate places. [2025-04-13 19:58:50,257 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 313 transitions, 4000 flow [2025-04-13 19:58:50,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:50,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:50,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:50,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:58:50,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 19:58:50,458 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-13 19:58:50,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash -422532244, now seen corresponding path program 10 times [2025-04-13 19:58:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:50,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140217728] [2025-04-13 19:58:50,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:58:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:50,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:58:50,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:58:50,477 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:58:50,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:58:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:52,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140217728] [2025-04-13 19:58:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140217728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:52,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836753702] [2025-04-13 19:58:52,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:58:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:52,169 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:58:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 19:58:52,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:58:52,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:58:52,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:58:52,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 19:58:52,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2025-04-13 20:00:15,733 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:00:15,737 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:00:15,743 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:00:15,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:00:15,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:00:15,944 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 17 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-1 term,while PolyPacSimplificationTermWalker was simplifying 8 xjuncts wrt. a ATOM-1 context. [2025-04-13 20:00:15,946 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:00:15,946 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:00:15,946 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 2, 1] [2025-04-13 20:00:15,948 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:00:15,948 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:00:15,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:00:15 BasicIcfg [2025-04-13 20:00:15,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:00:15,952 INFO L158 Benchmark]: Toolchain (without parser) took 879401.92ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 101.7MB in the beginning and 49.1MB in the end (delta: 52.5MB). Peak memory consumption was 106.6MB. Max. memory is 8.0GB. [2025-04-13 20:00:15,952 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:15,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 87.2MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:00:15,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.16ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:00:15,952 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:00:15,952 INFO L158 Benchmark]: RCFGBuilder took 311.86ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.1MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 20:00:15,953 INFO L158 Benchmark]: TraceAbstraction took 878816.97ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 62.1MB in the beginning and 49.1MB in the end (delta: 13.0MB). Peak memory consumption was 68.8MB. Max. memory is 8.0GB. [2025-04-13 20:00:15,953 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 87.2MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.16ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 311.86ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.1MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 878816.97ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 62.1MB in the beginning and 49.1MB in the end (delta: 13.0MB). Peak memory consumption was 68.8MB. 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 17 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-1 term,while PolyPacSimplificationTermWalker was simplifying 8 xjuncts wrt. a ATOM-1 context. - 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 17 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-1 term,while PolyPacSimplificationTermWalker was simplifying 8 xjuncts wrt. a ATOM-1 context. - 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 17 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-1 term,while PolyPacSimplificationTermWalker was simplifying 8 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 878.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 566.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 696 SdHoareTripleChecker+Valid, 232.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 231.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4139 IncrementalHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 0 mSDtfsCounter, 4139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 222 SyntacticMatches, 14 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 524.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4298occurred in iteration=13, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 223.2s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 9519 SizeOfPredicates, 36 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 12/131 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