/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/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:44:53,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:44:53,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:44:53,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:44:53,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:44:53,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:44:53,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:44:53,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:44:53,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:44:53,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:44:53,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:44:53,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:44:53,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:44:53,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:53,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:44:53,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:53,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:44:53,172 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:44:53,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:44:53,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:44:53,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:44:53,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:44:53,408 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:44:53,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-13 20:44:54,649 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0ef0828/2b68dfb9cb8444a383bd9eb7976e5dfb/FLAG534f7f413 [2025-04-13 20:44:54,827 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:44:54,828 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-13 20:44:54,833 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0ef0828/2b68dfb9cb8444a383bd9eb7976e5dfb/FLAG534f7f413 [2025-04-13 20:44:55,849 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0ef0828/2b68dfb9cb8444a383bd9eb7976e5dfb [2025-04-13 20:44:55,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:44:55,853 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:44:55,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:44:55,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:44:55,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:44:55,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:44:55" (1/1) ... [2025-04-13 20:44:55,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acd00fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:55, skipping insertion in model container [2025-04-13 20:44:55,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:44:55" (1/1) ... [2025-04-13 20:44:55,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:44:56,037 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/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-13 20:44:56,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:44:56,051 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:44:56,079 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/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-13 20:44:56,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:44:56,100 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:44:56,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56 WrapperNode [2025-04-13 20:44:56,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:44:56,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:44:56,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:44:56,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:44:56,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,130 INFO L138 Inliner]: procedures = 24, calls = 19, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-13 20:44:56,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:44:56,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:44:56,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:44:56,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:44:56,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,162 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:44:56,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:44:56,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:44:56,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:44:56,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:44:56,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (1/1) ... [2025-04-13 20:44:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:56,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:44:56,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:44:56,215 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:44:56,289 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:44:56,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:44:56,442 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:44:56,443 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:44:56,443 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:44:56,613 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:44:56,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:44:56 BoogieIcfgContainer [2025-04-13 20:44:56,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:44:56,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:44:56,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:44:56,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:44:56,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:44:55" (1/3) ... [2025-04-13 20:44:56,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aba499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:44:56, skipping insertion in model container [2025-04-13 20:44:56,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:56" (2/3) ... [2025-04-13 20:44:56,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aba499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:44:56, skipping insertion in model container [2025-04-13 20:44:56,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:44:56" (3/3) ... [2025-04-13 20:44:56,622 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-04-13 20:44:56,633 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:44:56,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 23 locations, 23 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:44:56,634 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:44:56,673 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:44:56,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 73 flow [2025-04-13 20:44:56,718 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-13 20:44:56,721 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:44:56,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 4/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-13 20:44:56,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 26 transitions, 73 flow [2025-04-13 20:44:56,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 22 transitions, 62 flow [2025-04-13 20:44:56,734 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:44:56,748 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;@1d8f8622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:44:56,749 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:44:56,756 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:44:56,756 INFO L116 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-04-13 20:44:56,756 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:44:56,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:56,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:56,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:56,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash 234399610, now seen corresponding path program 1 times [2025-04-13 20:44:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:56,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965023964] [2025-04-13 20:44:56,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:56,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:44:56,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:44:56,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:56,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:57,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:57,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965023964] [2025-04-13 20:44:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965023964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:57,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:44:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188320196] [2025-04-13 20:44:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:57,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:44:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:44:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:44:57,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:57,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 20:44:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:57,478 INFO L116 PetriNetUnfolderBase]: 387/566 cut-off events. [2025-04-13 20:44:57,478 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-13 20:44:57,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 566 events. 387/566 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1774 event pairs, 124 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-04-13 20:44:57,485 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 34 selfloop transitions, 4 changer transitions 1/39 dead transitions. [2025-04-13 20:44:57,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 189 flow [2025-04-13 20:44:57,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:44:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:44:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 20:44:57,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-04-13 20:44:57,496 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 62 flow. Second operand 3 states and 49 transitions. [2025-04-13 20:44:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 189 flow [2025-04-13 20:44:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:44:57,503 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 76 flow [2025-04-13 20:44:57,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2025-04-13 20:44:57,507 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-04-13 20:44:57,507 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 76 flow [2025-04-13 20:44:57,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 20:44:57,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:57,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:57,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:44:57,507 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:57,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 175979432, now seen corresponding path program 1 times [2025-04-13 20:44:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:57,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456878180] [2025-04-13 20:44:57,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:57,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:44:57,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:44:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:57,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456878180] [2025-04-13 20:44:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456878180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:57,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:57,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:44:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405936559] [2025-04-13 20:44:57,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:57,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:44:57,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:57,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:44:57,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:44:57,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:57,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:57,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:57,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:57,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:57,811 INFO L116 PetriNetUnfolderBase]: 721/1075 cut-off events. [2025-04-13 20:44:57,811 INFO L117 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-04-13 20:44:57,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2587 conditions, 1075 events. 721/1075 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3889 event pairs, 417 based on Foata normal form. 42/1115 useless extension candidates. Maximal degree in co-relation 894. Up to 567 conditions per place. [2025-04-13 20:44:57,818 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 53 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-04-13 20:44:57,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 58 transitions, 288 flow [2025-04-13 20:44:57,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:44:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:44:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-13 20:44:57,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2025-04-13 20:44:57,820 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 76 flow. Second operand 5 states and 67 transitions. [2025-04-13 20:44:57,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 58 transitions, 288 flow [2025-04-13 20:44:57,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 58 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:44:57,821 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 110 flow [2025-04-13 20:44:57,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-04-13 20:44:57,822 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-04-13 20:44:57,822 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 110 flow [2025-04-13 20:44:57,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:57,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:57,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:57,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:44:57,824 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:57,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1894529204, now seen corresponding path program 1 times [2025-04-13 20:44:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:57,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102674673] [2025-04-13 20:44:57,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:57,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:57,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:44:57,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:44:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:57,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102674673] [2025-04-13 20:44:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102674673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:44:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189634472] [2025-04-13 20:44:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:57,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:44:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:57,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:44:57,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:44:57,918 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:57,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:57,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:57,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:57,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:58,068 INFO L116 PetriNetUnfolderBase]: 636/967 cut-off events. [2025-04-13 20:44:58,069 INFO L117 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2025-04-13 20:44:58,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 967 events. 636/967 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3615 event pairs, 391 based on Foata normal form. 42/1008 useless extension candidates. Maximal degree in co-relation 1436. Up to 567 conditions per place. [2025-04-13 20:44:58,075 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 51 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-04-13 20:44:58,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 302 flow [2025-04-13 20:44:58,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:44:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:44:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-13 20:44:58,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2025-04-13 20:44:58,076 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 110 flow. Second operand 5 states and 67 transitions. [2025-04-13 20:44:58,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 302 flow [2025-04-13 20:44:58,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 298 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:44:58,079 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 133 flow [2025-04-13 20:44:58,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-04-13 20:44:58,080 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2025-04-13 20:44:58,080 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 133 flow [2025-04-13 20:44:58,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:58,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:58,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:44:58,081 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:58,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 868807983, now seen corresponding path program 1 times [2025-04-13 20:44:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:58,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724070310] [2025-04-13 20:44:58,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:44:58,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:44:58,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:58,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:58,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724070310] [2025-04-13 20:44:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724070310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:44:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883008599] [2025-04-13 20:44:58,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:58,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:44:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:44:58,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:44:58,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:58,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:58,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:58,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:58,254 INFO L116 PetriNetUnfolderBase]: 511/783 cut-off events. [2025-04-13 20:44:58,254 INFO L117 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2025-04-13 20:44:58,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 783 events. 511/783 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2768 event pairs, 324 based on Foata normal form. 27/809 useless extension candidates. Maximal degree in co-relation 1586. Up to 567 conditions per place. [2025-04-13 20:44:58,257 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 24 selfloop transitions, 2 changer transitions 24/50 dead transitions. [2025-04-13 20:44:58,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 295 flow [2025-04-13 20:44:58,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:44:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:44:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-04-13 20:44:58,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2025-04-13 20:44:58,258 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 133 flow. Second operand 5 states and 63 transitions. [2025-04-13 20:44:58,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 295 flow [2025-04-13 20:44:58,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:44:58,260 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 106 flow [2025-04-13 20:44:58,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2025-04-13 20:44:58,261 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-04-13 20:44:58,261 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 106 flow [2025-04-13 20:44:58,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:58,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:58,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:44:58,261 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:58,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash -688848152, now seen corresponding path program 1 times [2025-04-13 20:44:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:58,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032221126] [2025-04-13 20:44:58,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:58,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:44:58,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:58,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:58,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032221126] [2025-04-13 20:44:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032221126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:58,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847068224] [2025-04-13 20:44:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:58,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:44:58,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:44:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:44:58,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:58,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:58,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:44:58,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:58,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847068224] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:44:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:44:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985751102] [2025-04-13 20:44:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:58,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:44:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:44:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:44:58,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:58,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:58,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:58,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:58,737 INFO L116 PetriNetUnfolderBase]: 517/762 cut-off events. [2025-04-13 20:44:58,738 INFO L117 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2025-04-13 20:44:58,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 762 events. 517/762 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2624 event pairs, 150 based on Foata normal form. 14/775 useless extension candidates. Maximal degree in co-relation 2312. Up to 379 conditions per place. [2025-04-13 20:44:58,741 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 55 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2025-04-13 20:44:58,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 392 flow [2025-04-13 20:44:58,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:44:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:44:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-13 20:44:58,742 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-13 20:44:58,742 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 106 flow. Second operand 7 states and 77 transitions. [2025-04-13 20:44:58,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 392 flow [2025-04-13 20:44:58,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 64 transitions, 320 flow, removed 34 selfloop flow, removed 8 redundant places. [2025-04-13 20:44:58,746 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 137 flow [2025-04-13 20:44:58,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-04-13 20:44:58,747 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-04-13 20:44:58,747 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 137 flow [2025-04-13 20:44:58,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:58,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:58,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:58,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:44:58,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:58,948 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:58,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 190852696, now seen corresponding path program 2 times [2025-04-13 20:44:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:58,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151170440] [2025-04-13 20:44:58,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:44:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:58,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:44:58,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:58,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:58,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:59,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151170440] [2025-04-13 20:44:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151170440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:59,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132436766] [2025-04-13 20:44:59,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:44:59,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:59,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:44:59,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:44:59,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:44:59,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:59,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:59,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:59,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:44:59,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132436766] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:44:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:44:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321753657] [2025-04-13 20:44:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:59,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:44:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:59,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:44:59,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:44:59,232 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:59,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:59,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:59,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:59,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:59,369 INFO L116 PetriNetUnfolderBase]: 678/1001 cut-off events. [2025-04-13 20:44:59,369 INFO L117 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2025-04-13 20:44:59,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 1001 events. 678/1001 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3615 event pairs, 240 based on Foata normal form. 12/1012 useless extension candidates. Maximal degree in co-relation 3019. Up to 593 conditions per place. [2025-04-13 20:44:59,373 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 57 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2025-04-13 20:44:59,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 433 flow [2025-04-13 20:44:59,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:44:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:44:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-04-13 20:44:59,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4010989010989011 [2025-04-13 20:44:59,374 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 137 flow. Second operand 7 states and 73 transitions. [2025-04-13 20:44:59,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 433 flow [2025-04-13 20:44:59,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 69 transitions, 398 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-04-13 20:44:59,377 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 194 flow [2025-04-13 20:44:59,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-04-13 20:44:59,378 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places. [2025-04-13 20:44:59,378 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 194 flow [2025-04-13 20:44:59,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:59,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:59,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:59,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:44:59,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:44:59,579 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:59,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 295917870, now seen corresponding path program 3 times [2025-04-13 20:44:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:59,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422424350] [2025-04-13 20:44:59,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:59,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:44:59,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:59,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:59,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422424350] [2025-04-13 20:44:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422424350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:59,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823606229] [2025-04-13 20:44:59,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:59,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:44:59,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:44:59,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:44:59,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:44:59,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:59,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:59,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:44:59,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823606229] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:44:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 20:44:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286689565] [2025-04-13 20:44:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:59,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:44:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:59,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:44:59,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:44:59,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:44:59,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:59,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:59,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:44:59,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:00,026 INFO L116 PetriNetUnfolderBase]: 784/1162 cut-off events. [2025-04-13 20:45:00,026 INFO L117 PetriNetUnfolderBase]: For 1913/1913 co-relation queries the response was YES. [2025-04-13 20:45:00,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 1162 events. 784/1162 cut-off events. For 1913/1913 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4409 event pairs, 319 based on Foata normal form. 14/1175 useless extension candidates. Maximal degree in co-relation 4043. Up to 820 conditions per place. [2025-04-13 20:45:00,034 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 56 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2025-04-13 20:45:00,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 517 flow [2025-04-13 20:45:00,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-13 20:45:00,035 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41208791208791207 [2025-04-13 20:45:00,035 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 194 flow. Second operand 7 states and 75 transitions. [2025-04-13 20:45:00,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 517 flow [2025-04-13 20:45:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 476 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:00,043 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 291 flow [2025-04-13 20:45:00,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-04-13 20:45:00,045 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2025-04-13 20:45:00,045 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 291 flow [2025-04-13 20:45:00,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:00,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:00,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:00,052 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 20:45:00,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:00,250 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:00,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 624906392, now seen corresponding path program 4 times [2025-04-13 20:45:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:00,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784452893] [2025-04-13 20:45:00,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:00,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:00,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 20 statements. [2025-04-13 20:45:00,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:00,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784452893] [2025-04-13 20:45:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784452893] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:00,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190574378] [2025-04-13 20:45:00,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:00,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:00,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:45:00,352 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:00,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 20 statements. [2025-04-13 20:45:00,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:00,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:00,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:00,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190574378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:00,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 20:45:00,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77795280] [2025-04-13 20:45:00,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:00,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:45:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:00,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:45:00,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:45:00,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:00,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 291 flow. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:00,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:00,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:00,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:00,938 INFO L116 PetriNetUnfolderBase]: 1176/1748 cut-off events. [2025-04-13 20:45:00,938 INFO L117 PetriNetUnfolderBase]: For 5166/5166 co-relation queries the response was YES. [2025-04-13 20:45:00,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 1748 events. 1176/1748 cut-off events. For 5166/5166 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7592 event pairs, 250 based on Foata normal form. 6/1753 useless extension candidates. Maximal degree in co-relation 6694. Up to 615 conditions per place. [2025-04-13 20:45:00,946 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 156 selfloop transitions, 47 changer transitions 0/203 dead transitions. [2025-04-13 20:45:00,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 203 transitions, 1743 flow [2025-04-13 20:45:00,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:45:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:45:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 182 transitions. [2025-04-13 20:45:00,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-13 20:45:00,947 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 291 flow. Second operand 17 states and 182 transitions. [2025-04-13 20:45:00,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 203 transitions, 1743 flow [2025-04-13 20:45:00,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 203 transitions, 1585 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:00,954 INFO L231 Difference]: Finished difference. Result has 72 places, 91 transitions, 868 flow [2025-04-13 20:45:00,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=868, PETRI_PLACES=72, PETRI_TRANSITIONS=91} [2025-04-13 20:45:00,955 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 44 predicate places. [2025-04-13 20:45:00,955 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 91 transitions, 868 flow [2025-04-13 20:45:00,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:00,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:00,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:00,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:01,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,156 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:01,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -918234734, now seen corresponding path program 1 times [2025-04-13 20:45:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:01,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433308514] [2025-04-13 20:45:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:01,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:45:01,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:01,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:01,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:01,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433308514] [2025-04-13 20:45:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433308514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030929240] [2025-04-13 20:45:01,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:01,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:01,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:45:01,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:45:01,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:01,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030929240] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-13 20:45:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413264356] [2025-04-13 20:45:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:01,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:45:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:01,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:45:01,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:45:01,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:01,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 91 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:01,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:01,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:01,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:01,465 INFO L116 PetriNetUnfolderBase]: 934/1380 cut-off events. [2025-04-13 20:45:01,465 INFO L117 PetriNetUnfolderBase]: For 8918/8918 co-relation queries the response was YES. [2025-04-13 20:45:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 1380 events. 934/1380 cut-off events. For 8918/8918 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5529 event pairs, 366 based on Foata normal form. 74/1453 useless extension candidates. Maximal degree in co-relation 6724. Up to 1134 conditions per place. [2025-04-13 20:45:01,475 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 110 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-04-13 20:45:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1303 flow [2025-04-13 20:45:01,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:45:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:45:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-13 20:45:01,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3923076923076923 [2025-04-13 20:45:01,476 INFO L175 Difference]: Start difference. First operand has 72 places, 91 transitions, 868 flow. Second operand 5 states and 51 transitions. [2025-04-13 20:45:01,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1303 flow [2025-04-13 20:45:01,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 115 transitions, 1243 flow, removed 30 selfloop flow, removed 0 redundant places. [2025-04-13 20:45:01,490 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 813 flow [2025-04-13 20:45:01,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=813, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-04-13 20:45:01,491 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2025-04-13 20:45:01,491 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 813 flow [2025-04-13 20:45:01,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:01,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:01,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:01,497 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 20:45:01,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,692 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:01,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 506518040, now seen corresponding path program 5 times [2025-04-13 20:45:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:01,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932070388] [2025-04-13 20:45:01,693 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:01,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:01,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:01,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:01,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:01,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932070388] [2025-04-13 20:45:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932070388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60627928] [2025-04-13 20:45:01,778 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:01,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:01,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:01,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:45:01,818 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:01,834 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:01,835 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:01,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:01,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60627928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:01,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 20:45:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936267444] [2025-04-13 20:45:01,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:01,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:45:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:01,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:45:01,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:45:01,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:01,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 813 flow. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:01,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:01,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:01,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:02,576 INFO L116 PetriNetUnfolderBase]: 1168/1742 cut-off events. [2025-04-13 20:45:02,576 INFO L117 PetriNetUnfolderBase]: For 12165/12165 co-relation queries the response was YES. [2025-04-13 20:45:02,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 1742 events. 1168/1742 cut-off events. For 12165/12165 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7323 event pairs, 237 based on Foata normal form. 14/1755 useless extension candidates. Maximal degree in co-relation 8601. Up to 754 conditions per place. [2025-04-13 20:45:02,589 INFO L140 encePairwiseOnDemand]: 15/26 looper letters, 115 selfloop transitions, 122 changer transitions 0/237 dead transitions. [2025-04-13 20:45:02,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 237 transitions, 2405 flow [2025-04-13 20:45:02,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:45:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:45:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2025-04-13 20:45:02,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3803418803418803 [2025-04-13 20:45:02,591 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 813 flow. Second operand 18 states and 178 transitions. [2025-04-13 20:45:02,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 237 transitions, 2405 flow [2025-04-13 20:45:02,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 237 transitions, 2355 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:02,620 INFO L231 Difference]: Finished difference. Result has 93 places, 155 transitions, 1883 flow [2025-04-13 20:45:02,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1883, PETRI_PLACES=93, PETRI_TRANSITIONS=155} [2025-04-13 20:45:02,620 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 65 predicate places. [2025-04-13 20:45:02,620 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 155 transitions, 1883 flow [2025-04-13 20:45:02,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:02,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:02,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:02,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:02,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:02,825 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:02,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash -54036100, now seen corresponding path program 6 times [2025-04-13 20:45:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:02,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419785773] [2025-04-13 20:45:02,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:02,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:02,838 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:02,838 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:02,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:02,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419785773] [2025-04-13 20:45:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419785773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:02,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084528965] [2025-04-13 20:45:02,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:02,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:02,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:45:02,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:45:02,959 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:02,960 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:02,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:02,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:03,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084528965] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 20:45:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614869944] [2025-04-13 20:45:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:03,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:45:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:03,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:45:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:03,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:03,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 155 transitions, 1883 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:03,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:03,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:03,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:03,283 INFO L116 PetriNetUnfolderBase]: 1144/1686 cut-off events. [2025-04-13 20:45:03,283 INFO L117 PetriNetUnfolderBase]: For 13986/13986 co-relation queries the response was YES. [2025-04-13 20:45:03,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9540 conditions, 1686 events. 1144/1686 cut-off events. For 13986/13986 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6919 event pairs, 332 based on Foata normal form. 20/1706 useless extension candidates. Maximal degree in co-relation 9493. Up to 1282 conditions per place. [2025-04-13 20:45:03,293 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 130 selfloop transitions, 66 changer transitions 0/196 dead transitions. [2025-04-13 20:45:03,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 196 transitions, 2576 flow [2025-04-13 20:45:03,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:45:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:45:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2025-04-13 20:45:03,294 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2025-04-13 20:45:03,294 INFO L175 Difference]: Start difference. First operand has 93 places, 155 transitions, 1883 flow. Second operand 8 states and 82 transitions. [2025-04-13 20:45:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 196 transitions, 2576 flow [2025-04-13 20:45:03,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 196 transitions, 2147 flow, removed 148 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:03,331 INFO L231 Difference]: Finished difference. Result has 94 places, 161 transitions, 1703 flow [2025-04-13 20:45:03,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1703, PETRI_PLACES=94, PETRI_TRANSITIONS=161} [2025-04-13 20:45:03,332 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 66 predicate places. [2025-04-13 20:45:03,332 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 161 transitions, 1703 flow [2025-04-13 20:45:03,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:03,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:03,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:03,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:03,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:03,532 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:03,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1991283866, now seen corresponding path program 7 times [2025-04-13 20:45:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:03,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731612046] [2025-04-13 20:45:03,533 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:03,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:45:03,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:03,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:03,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:03,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731612046] [2025-04-13 20:45:03,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731612046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:03,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016122058] [2025-04-13 20:45:03,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:03,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:03,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:03,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:45:03,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:45:03,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:03,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:03,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:03,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:03,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:03,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016122058] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 20:45:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429535810] [2025-04-13 20:45:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:03,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:45:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:03,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:45:03,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:03,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:03,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 161 transitions, 1703 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:03,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:03,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:03,993 INFO L116 PetriNetUnfolderBase]: 1120/1630 cut-off events. [2025-04-13 20:45:03,994 INFO L117 PetriNetUnfolderBase]: For 7616/7616 co-relation queries the response was YES. [2025-04-13 20:45:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8280 conditions, 1630 events. 1120/1630 cut-off events. For 7616/7616 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6480 event pairs, 256 based on Foata normal form. 20/1650 useless extension candidates. Maximal degree in co-relation 8234. Up to 756 conditions per place. [2025-04-13 20:45:04,004 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 88 selfloop transitions, 90 changer transitions 0/178 dead transitions. [2025-04-13 20:45:04,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 178 transitions, 2098 flow [2025-04-13 20:45:04,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-13 20:45:04,006 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4065934065934066 [2025-04-13 20:45:04,006 INFO L175 Difference]: Start difference. First operand has 94 places, 161 transitions, 1703 flow. Second operand 7 states and 74 transitions. [2025-04-13 20:45:04,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 178 transitions, 2098 flow [2025-04-13 20:45:04,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 178 transitions, 1956 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:04,023 INFO L231 Difference]: Finished difference. Result has 90 places, 154 transitions, 1647 flow [2025-04-13 20:45:04,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1647, PETRI_PLACES=90, PETRI_TRANSITIONS=154} [2025-04-13 20:45:04,023 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 62 predicate places. [2025-04-13 20:45:04,023 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 154 transitions, 1647 flow [2025-04-13 20:45:04,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:04,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:04,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:04,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:04,224 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,SelfDestructingSolverStorable11 [2025-04-13 20:45:04,224 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:04,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1696907268, now seen corresponding path program 1 times [2025-04-13 20:45:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:04,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876446798] [2025-04-13 20:45:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:04,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:45:04,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:04,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:04,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:04,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876446798] [2025-04-13 20:45:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876446798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:04,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312169463] [2025-04-13 20:45:04,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:04,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:04,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:45:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:45:04,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:04,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 20:45:04,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:04,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:04,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:04,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-13 20:45:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:05,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312169463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:05,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 23 [2025-04-13 20:45:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452806679] [2025-04-13 20:45:05,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:05,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:45:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:05,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:45:05,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:45:05,232 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:05,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 154 transitions, 1647 flow. Second operand has 25 states, 25 states have (on average 5.52) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:05,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:05,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:06,399 INFO L116 PetriNetUnfolderBase]: 2349/3425 cut-off events. [2025-04-13 20:45:06,399 INFO L117 PetriNetUnfolderBase]: For 14188/14188 co-relation queries the response was YES. [2025-04-13 20:45:06,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17488 conditions, 3425 events. 2349/3425 cut-off events. For 14188/14188 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16057 event pairs, 133 based on Foata normal form. 2/3427 useless extension candidates. Maximal degree in co-relation 16676. Up to 2040 conditions per place. [2025-04-13 20:45:06,418 INFO L140 encePairwiseOnDemand]: 14/26 looper letters, 322 selfloop transitions, 263 changer transitions 2/587 dead transitions. [2025-04-13 20:45:06,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 587 transitions, 6894 flow [2025-04-13 20:45:06,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 20:45:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 20:45:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 306 transitions. [2025-04-13 20:45:06,419 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4526627218934911 [2025-04-13 20:45:06,419 INFO L175 Difference]: Start difference. First operand has 90 places, 154 transitions, 1647 flow. Second operand 26 states and 306 transitions. [2025-04-13 20:45:06,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 587 transitions, 6894 flow [2025-04-13 20:45:06,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 587 transitions, 6315 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:06,464 INFO L231 Difference]: Finished difference. Result has 121 places, 406 transitions, 4781 flow [2025-04-13 20:45:06,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4781, PETRI_PLACES=121, PETRI_TRANSITIONS=406} [2025-04-13 20:45:06,465 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 93 predicate places. [2025-04-13 20:45:06,465 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 406 transitions, 4781 flow [2025-04-13 20:45:06,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.52) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:06,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:06,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:06,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:45:06,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:45:06,666 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:06,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash -442745469, now seen corresponding path program 1 times [2025-04-13 20:45:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:06,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814795404] [2025-04-13 20:45:06,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:06,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:45:06,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:06,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:06,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:07,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814795404] [2025-04-13 20:45:07,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814795404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:07,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479767164] [2025-04-13 20:45:07,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:07,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:07,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:07,032 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:07,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:45:07,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:45:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:07,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:07,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:45:07,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:07,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:07,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:07,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479767164] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:07,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 14 [2025-04-13 20:45:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301680137] [2025-04-13 20:45:07,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:07,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:45:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:07,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:45:07,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:45:07,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:07,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 406 transitions, 4781 flow. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:07,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:07,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:07,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:07,831 INFO L116 PetriNetUnfolderBase]: 2788/4051 cut-off events. [2025-04-13 20:45:07,831 INFO L117 PetriNetUnfolderBase]: For 18749/18749 co-relation queries the response was YES. [2025-04-13 20:45:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22752 conditions, 4051 events. 2788/4051 cut-off events. For 18749/18749 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 19437 event pairs, 185 based on Foata normal form. 4/4055 useless extension candidates. Maximal degree in co-relation 22156. Up to 2551 conditions per place. [2025-04-13 20:45:07,852 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 318 selfloop transitions, 239 changer transitions 1/558 dead transitions. [2025-04-13 20:45:07,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 558 transitions, 7385 flow [2025-04-13 20:45:07,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:45:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:45:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-04-13 20:45:07,853 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 20:45:07,854 INFO L175 Difference]: Start difference. First operand has 121 places, 406 transitions, 4781 flow. Second operand 9 states and 114 transitions. [2025-04-13 20:45:07,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 558 transitions, 7385 flow [2025-04-13 20:45:07,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 558 transitions, 6965 flow, removed 174 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:07,991 INFO L231 Difference]: Finished difference. Result has 129 places, 463 transitions, 5776 flow [2025-04-13 20:45:07,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4425, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5776, PETRI_PLACES=129, PETRI_TRANSITIONS=463} [2025-04-13 20:45:07,993 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 101 predicate places. [2025-04-13 20:45:07,993 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 463 transitions, 5776 flow [2025-04-13 20:45:07,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:07,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:07,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:08,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:08,194 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,SelfDestructingSolverStorable13 [2025-04-13 20:45:08,194 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:08,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash -637479322, now seen corresponding path program 2 times [2025-04-13 20:45:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:08,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278713029] [2025-04-13 20:45:08,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:08,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:08,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:08,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:08,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278713029] [2025-04-13 20:45:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278713029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:08,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186766074] [2025-04-13 20:45:08,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:08,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:08,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:45:08,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:08,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:08,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:08,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:45:08,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:08,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:08,890 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:08,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-13 20:45:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:08,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:09,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:45:09,387 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:09,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2025-04-13 20:45:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186766074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:09,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 20:45:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724088609] [2025-04-13 20:45:09,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:09,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:45:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:09,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:45:09,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:45:09,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:09,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 463 transitions, 5776 flow. Second operand has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:09,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:09,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:09,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:12,023 INFO L116 PetriNetUnfolderBase]: 3130/4543 cut-off events. [2025-04-13 20:45:12,023 INFO L117 PetriNetUnfolderBase]: For 23844/23844 co-relation queries the response was YES. [2025-04-13 20:45:12,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26659 conditions, 4543 events. 3130/4543 cut-off events. For 23844/23844 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 22217 event pairs, 316 based on Foata normal form. 2/4545 useless extension candidates. Maximal degree in co-relation 26105. Up to 3866 conditions per place. [2025-04-13 20:45:12,048 INFO L140 encePairwiseOnDemand]: 14/26 looper letters, 466 selfloop transitions, 211 changer transitions 6/683 dead transitions. [2025-04-13 20:45:12,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 683 transitions, 8831 flow [2025-04-13 20:45:12,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:45:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:45:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 354 transitions. [2025-04-13 20:45:12,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.367983367983368 [2025-04-13 20:45:12,050 INFO L175 Difference]: Start difference. First operand has 129 places, 463 transitions, 5776 flow. Second operand 37 states and 354 transitions. [2025-04-13 20:45:12,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 683 transitions, 8831 flow [2025-04-13 20:45:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 683 transitions, 8454 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-04-13 20:45:12,172 INFO L231 Difference]: Finished difference. Result has 175 places, 565 transitions, 7136 flow [2025-04-13 20:45:12,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5444, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7136, PETRI_PLACES=175, PETRI_TRANSITIONS=565} [2025-04-13 20:45:12,173 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 147 predicate places. [2025-04-13 20:45:12,173 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 565 transitions, 7136 flow [2025-04-13 20:45:12,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:12,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:12,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:12,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:12,373 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,SelfDestructingSolverStorable14 [2025-04-13 20:45:12,374 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:12,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 108530737, now seen corresponding path program 2 times [2025-04-13 20:45:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:12,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385255633] [2025-04-13 20:45:12,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:12,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:12,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:12,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:12,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385255633] [2025-04-13 20:45:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385255633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:12,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900434623] [2025-04-13 20:45:12,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:12,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:12,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:45:12,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:12,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:12,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:12,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:45:12,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:12,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:12,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:12,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:12,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-04-13 20:45:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900434623] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:13,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 13 [2025-04-13 20:45:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007021217] [2025-04-13 20:45:13,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:13,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:45:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:13,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:45:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:13,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:13,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 565 transitions, 7136 flow. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:13,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:13,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:13,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:13,707 INFO L116 PetriNetUnfolderBase]: 3671/5314 cut-off events. [2025-04-13 20:45:13,707 INFO L117 PetriNetUnfolderBase]: For 32101/32101 co-relation queries the response was YES. [2025-04-13 20:45:13,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32523 conditions, 5314 events. 3671/5314 cut-off events. For 32101/32101 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 26614 event pairs, 383 based on Foata normal form. 4/5318 useless extension candidates. Maximal degree in co-relation 32298. Up to 4463 conditions per place. [2025-04-13 20:45:13,782 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 524 selfloop transitions, 192 changer transitions 1/717 dead transitions. [2025-04-13 20:45:13,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 717 transitions, 10279 flow [2025-04-13 20:45:13,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:45:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:45:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-04-13 20:45:13,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-04-13 20:45:13,783 INFO L175 Difference]: Start difference. First operand has 175 places, 565 transitions, 7136 flow. Second operand 9 states and 108 transitions. [2025-04-13 20:45:13,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 717 transitions, 10279 flow [2025-04-13 20:45:13,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 717 transitions, 9875 flow, removed 146 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:13,934 INFO L231 Difference]: Finished difference. Result has 179 places, 640 transitions, 8307 flow [2025-04-13 20:45:13,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6760, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8307, PETRI_PLACES=179, PETRI_TRANSITIONS=640} [2025-04-13 20:45:13,935 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 151 predicate places. [2025-04-13 20:45:13,935 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 640 transitions, 8307 flow [2025-04-13 20:45:13,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:13,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:13,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:13,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:14,135 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,SelfDestructingSolverStorable15 [2025-04-13 20:45:14,135 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:14,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -909413327, now seen corresponding path program 3 times [2025-04-13 20:45:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:14,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186358218] [2025-04-13 20:45:14,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:14,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:14,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:14,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:14,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:14,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186358218] [2025-04-13 20:45:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186358218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:14,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061995136] [2025-04-13 20:45:14,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:14,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:14,381 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:14,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:45:14,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:14,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:14,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:14,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:45:14,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:14,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:14,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:14,572 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:14,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-04-13 20:45:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061995136] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:14,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 13 [2025-04-13 20:45:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125548099] [2025-04-13 20:45:14,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:14,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:45:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:45:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:14,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:14,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 640 transitions, 8307 flow. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:14,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:14,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:14,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:15,692 INFO L116 PetriNetUnfolderBase]: 3922/5678 cut-off events. [2025-04-13 20:45:15,692 INFO L117 PetriNetUnfolderBase]: For 38245/38245 co-relation queries the response was YES. [2025-04-13 20:45:15,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35731 conditions, 5678 events. 3922/5678 cut-off events. For 38245/38245 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 28728 event pairs, 427 based on Foata normal form. 4/5682 useless extension candidates. Maximal degree in co-relation 35527. Up to 5048 conditions per place. [2025-04-13 20:45:15,720 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 561 selfloop transitions, 151 changer transitions 1/713 dead transitions. [2025-04-13 20:45:15,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 713 transitions, 10469 flow [2025-04-13 20:45:15,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:45:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:45:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-04-13 20:45:15,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.452991452991453 [2025-04-13 20:45:15,721 INFO L175 Difference]: Start difference. First operand has 179 places, 640 transitions, 8307 flow. Second operand 9 states and 106 transitions. [2025-04-13 20:45:15,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 713 transitions, 10469 flow [2025-04-13 20:45:15,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 713 transitions, 10215 flow, removed 37 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:15,916 INFO L231 Difference]: Finished difference. Result has 185 places, 653 transitions, 8599 flow [2025-04-13 20:45:15,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8053, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8599, PETRI_PLACES=185, PETRI_TRANSITIONS=653} [2025-04-13 20:45:15,916 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 157 predicate places. [2025-04-13 20:45:15,916 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 653 transitions, 8599 flow [2025-04-13 20:45:15,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:15,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:15,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:15,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:16,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:45:16,117 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:16,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1558034110, now seen corresponding path program 3 times [2025-04-13 20:45:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:16,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316525462] [2025-04-13 20:45:16,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:16,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:16,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:16,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:16,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316525462] [2025-04-13 20:45:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316525462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:16,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873977877] [2025-04-13 20:45:16,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:16,413 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:16,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:45:16,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:16,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:16,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:16,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:16,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:45:16,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:16,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:16,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:16,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:17,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:45:17,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:17,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2025-04-13 20:45:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873977877] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:18,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:18,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 26 [2025-04-13 20:45:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374656771] [2025-04-13 20:45:18,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:18,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:45:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:18,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:45:18,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:45:18,288 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:18,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 653 transitions, 8599 flow. Second operand has 28 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:18,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:18,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:18,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:19,936 INFO L116 PetriNetUnfolderBase]: 4085/5927 cut-off events. [2025-04-13 20:45:19,936 INFO L117 PetriNetUnfolderBase]: For 40530/40530 co-relation queries the response was YES. [2025-04-13 20:45:19,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37342 conditions, 5927 events. 4085/5927 cut-off events. For 40530/40530 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 30266 event pairs, 506 based on Foata normal form. 2/5929 useless extension candidates. Maximal degree in co-relation 37130. Up to 5269 conditions per place. [2025-04-13 20:45:19,965 INFO L140 encePairwiseOnDemand]: 13/26 looper letters, 573 selfloop transitions, 203 changer transitions 2/778 dead transitions. [2025-04-13 20:45:19,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 778 transitions, 11236 flow [2025-04-13 20:45:19,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:45:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:45:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 282 transitions. [2025-04-13 20:45:19,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3740053050397878 [2025-04-13 20:45:19,967 INFO L175 Difference]: Start difference. First operand has 185 places, 653 transitions, 8599 flow. Second operand 29 states and 282 transitions. [2025-04-13 20:45:19,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 778 transitions, 11236 flow [2025-04-13 20:45:20,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 778 transitions, 10964 flow, removed 43 selfloop flow, removed 5 redundant places. [2025-04-13 20:45:20,176 INFO L231 Difference]: Finished difference. Result has 213 places, 684 transitions, 9228 flow [2025-04-13 20:45:20,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8338, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=9228, PETRI_PLACES=213, PETRI_TRANSITIONS=684} [2025-04-13 20:45:20,176 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 185 predicate places. [2025-04-13 20:45:20,176 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 684 transitions, 9228 flow [2025-04-13 20:45:20,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:20,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:20,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:20,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:20,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:20,377 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:20,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -853845590, now seen corresponding path program 4 times [2025-04-13 20:45:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:20,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883797536] [2025-04-13 20:45:20,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:20,382 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:20,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:20,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:20,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:20,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883797536] [2025-04-13 20:45:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883797536] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:20,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62371360] [2025-04-13 20:45:20,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:20,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:20,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:20,597 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:20,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:45:20,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:20,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:20,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:20,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:20,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 20:45:20,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:20,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:20,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:20,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:21,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:45:21,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:21,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2025-04-13 20:45:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62371360] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:21,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-13 20:45:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254957175] [2025-04-13 20:45:21,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:21,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:45:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:21,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:45:21,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:45:21,743 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:21,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 684 transitions, 9228 flow. Second operand has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 22 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:21,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:21,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:23,229 INFO L116 PetriNetUnfolderBase]: 4780/6916 cut-off events. [2025-04-13 20:45:23,229 INFO L117 PetriNetUnfolderBase]: For 50513/50513 co-relation queries the response was YES. [2025-04-13 20:45:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44302 conditions, 6916 events. 4780/6916 cut-off events. For 50513/50513 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 36218 event pairs, 526 based on Foata normal form. 4/6920 useless extension candidates. Maximal degree in co-relation 43986. Up to 5516 conditions per place. [2025-04-13 20:45:23,274 INFO L140 encePairwiseOnDemand]: 15/26 looper letters, 587 selfloop transitions, 320 changer transitions 5/912 dead transitions. [2025-04-13 20:45:23,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 912 transitions, 13503 flow [2025-04-13 20:45:23,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 20:45:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 20:45:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 291 transitions. [2025-04-13 20:45:23,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43047337278106507 [2025-04-13 20:45:23,276 INFO L175 Difference]: Start difference. First operand has 213 places, 684 transitions, 9228 flow. Second operand 26 states and 291 transitions. [2025-04-13 20:45:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 912 transitions, 13503 flow [2025-04-13 20:45:23,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 912 transitions, 13128 flow, removed 55 selfloop flow, removed 10 redundant places. [2025-04-13 20:45:23,605 INFO L231 Difference]: Finished difference. Result has 241 places, 804 transitions, 11331 flow [2025-04-13 20:45:23,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=11331, PETRI_PLACES=241, PETRI_TRANSITIONS=804} [2025-04-13 20:45:23,606 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 213 predicate places. [2025-04-13 20:45:23,606 INFO L485 AbstractCegarLoop]: Abstraction has has 241 places, 804 transitions, 11331 flow [2025-04-13 20:45:23,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 22 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:23,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:23,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:23,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:45:23,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:23,810 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:23,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1030374411, now seen corresponding path program 4 times [2025-04-13 20:45:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:23,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557899876] [2025-04-13 20:45:23,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:23,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:23,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:23,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:23,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:23,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:23,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557899876] [2025-04-13 20:45:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557899876] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:23,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775249310] [2025-04-13 20:45:23,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:23,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:23,921 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:23,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:45:23,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:23,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:23,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:23,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:23,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 20:45:23,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:24,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:24,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:24,136 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:24,136 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2025-04-13 20:45:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775249310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:24,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 14 [2025-04-13 20:45:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691120490] [2025-04-13 20:45:24,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:24,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:45:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:24,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:45:24,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:45:24,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:24,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 804 transitions, 11331 flow. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 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 20:45:24,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:24,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:25,350 INFO L116 PetriNetUnfolderBase]: 5103/7384 cut-off events. [2025-04-13 20:45:25,351 INFO L117 PetriNetUnfolderBase]: For 66374/66374 co-relation queries the response was YES. [2025-04-13 20:45:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50851 conditions, 7384 events. 5103/7384 cut-off events. For 66374/66374 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 39148 event pairs, 552 based on Foata normal form. 4/7388 useless extension candidates. Maximal degree in co-relation 50483. Up to 6572 conditions per place. [2025-04-13 20:45:25,398 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 676 selfloop transitions, 189 changer transitions 1/866 dead transitions. [2025-04-13 20:45:25,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 866 transitions, 13712 flow [2025-04-13 20:45:25,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2025-04-13 20:45:25,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.532967032967033 [2025-04-13 20:45:25,399 INFO L175 Difference]: Start difference. First operand has 241 places, 804 transitions, 11331 flow. Second operand 7 states and 97 transitions. [2025-04-13 20:45:25,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 866 transitions, 13712 flow [2025-04-13 20:45:25,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 866 transitions, 13337 flow, removed 181 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:25,833 INFO L231 Difference]: Finished difference. Result has 245 places, 824 transitions, 11750 flow [2025-04-13 20:45:25,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=10966, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11750, PETRI_PLACES=245, PETRI_TRANSITIONS=824} [2025-04-13 20:45:25,833 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 217 predicate places. [2025-04-13 20:45:25,833 INFO L485 AbstractCegarLoop]: Abstraction has has 245 places, 824 transitions, 11750 flow [2025-04-13 20:45:25,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 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 20:45:25,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:25,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:25,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:45:26,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:26,038 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:26,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1591665675, now seen corresponding path program 5 times [2025-04-13 20:45:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:26,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817091019] [2025-04-13 20:45:26,039 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:26,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:26,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:26,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:26,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:26,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817091019] [2025-04-13 20:45:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817091019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:26,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471079302] [2025-04-13 20:45:26,145 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:26,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:45:26,188 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:26,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:26,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:26,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:45:26,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:26,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:26,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:26,341 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:26,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-04-13 20:45:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471079302] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:26,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 14 [2025-04-13 20:45:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911504876] [2025-04-13 20:45:26,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:26,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:45:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:45:26,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:45:26,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:26,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 824 transitions, 11750 flow. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 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 20:45:26,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:26,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:26,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:27,777 INFO L116 PetriNetUnfolderBase]: 5288/7661 cut-off events. [2025-04-13 20:45:27,777 INFO L117 PetriNetUnfolderBase]: For 69748/69748 co-relation queries the response was YES. [2025-04-13 20:45:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52598 conditions, 7661 events. 5288/7661 cut-off events. For 69748/69748 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 40919 event pairs, 706 based on Foata normal form. 4/7665 useless extension candidates. Maximal degree in co-relation 52222. Up to 6798 conditions per place. [2025-04-13 20:45:27,838 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 674 selfloop transitions, 229 changer transitions 1/904 dead transitions. [2025-04-13 20:45:27,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 904 transitions, 14415 flow [2025-04-13 20:45:27,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-04-13 20:45:27,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 20:45:27,839 INFO L175 Difference]: Start difference. First operand has 245 places, 824 transitions, 11750 flow. Second operand 7 states and 98 transitions. [2025-04-13 20:45:27,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 904 transitions, 14415 flow [2025-04-13 20:45:28,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 904 transitions, 14080 flow, removed 68 selfloop flow, removed 2 redundant places. [2025-04-13 20:45:28,345 INFO L231 Difference]: Finished difference. Result has 251 places, 841 transitions, 12277 flow [2025-04-13 20:45:28,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11415, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12277, PETRI_PLACES=251, PETRI_TRANSITIONS=841} [2025-04-13 20:45:28,345 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 223 predicate places. [2025-04-13 20:45:28,346 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 841 transitions, 12277 flow [2025-04-13 20:45:28,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 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 20:45:28,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:28,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:28,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 20:45:28,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:28,546 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:28,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 573721611, now seen corresponding path program 6 times [2025-04-13 20:45:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:28,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084202074] [2025-04-13 20:45:28,547 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:28,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:28,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:28,561 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:28,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084202074] [2025-04-13 20:45:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084202074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:28,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530615774] [2025-04-13 20:45:28,790 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:28,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:28,792 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:45:28,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:28,845 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:28,845 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:45:28,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:28,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:28,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:28,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:28,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-04-13 20:45:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530615774] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:29,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 13 [2025-04-13 20:45:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892866333] [2025-04-13 20:45:29,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:29,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:45:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:29,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:45:29,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:29,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:29,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 841 transitions, 12277 flow. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:29,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:29,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:30,421 INFO L116 PetriNetUnfolderBase]: 5455/7913 cut-off events. [2025-04-13 20:45:30,421 INFO L117 PetriNetUnfolderBase]: For 75522/75522 co-relation queries the response was YES. [2025-04-13 20:45:30,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55077 conditions, 7913 events. 5455/7913 cut-off events. For 75522/75522 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 42593 event pairs, 743 based on Foata normal form. 4/7917 useless extension candidates. Maximal degree in co-relation 54692. Up to 7291 conditions per place. [2025-04-13 20:45:30,472 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 705 selfloop transitions, 184 changer transitions 1/890 dead transitions. [2025-04-13 20:45:30,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 890 transitions, 14545 flow [2025-04-13 20:45:30,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:45:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:45:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-04-13 20:45:30,473 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44017094017094016 [2025-04-13 20:45:30,473 INFO L175 Difference]: Start difference. First operand has 251 places, 841 transitions, 12277 flow. Second operand 9 states and 103 transitions. [2025-04-13 20:45:30,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 890 transitions, 14545 flow [2025-04-13 20:45:30,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 890 transitions, 13953 flow, removed 110 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:30,974 INFO L231 Difference]: Finished difference. Result has 257 places, 849 transitions, 12277 flow [2025-04-13 20:45:30,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11685, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12277, PETRI_PLACES=257, PETRI_TRANSITIONS=849} [2025-04-13 20:45:30,974 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 229 predicate places. [2025-04-13 20:45:30,974 INFO L485 AbstractCegarLoop]: Abstraction has has 257 places, 849 transitions, 12277 flow [2025-04-13 20:45:30,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:30,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:30,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:30,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:45:31,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:31,175 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:31,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1752054842, now seen corresponding path program 5 times [2025-04-13 20:45:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:31,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163814224] [2025-04-13 20:45:31,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:31,179 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:31,186 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:31,186 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:31,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:31,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163814224] [2025-04-13 20:45:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163814224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:31,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218946227] [2025-04-13 20:45:31,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:31,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:31,468 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:31,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:45:31,510 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:31,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:31,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:31,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:31,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 20:45:31,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:31,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:31,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:45:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:31,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:31,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:45:31,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:31,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2025-04-13 20:45:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218946227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:32,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-04-13 20:45:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750288003] [2025-04-13 20:45:32,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:32,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:45:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:32,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:45:32,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:45:32,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:32,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 849 transitions, 12277 flow. Second operand has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:32,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:32,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:32,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:33,866 INFO L116 PetriNetUnfolderBase]: 5754/8340 cut-off events. [2025-04-13 20:45:33,866 INFO L117 PetriNetUnfolderBase]: For 80705/80705 co-relation queries the response was YES. [2025-04-13 20:45:33,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57550 conditions, 8340 events. 5754/8340 cut-off events. For 80705/80705 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45237 event pairs, 771 based on Foata normal form. 2/8342 useless extension candidates. Maximal degree in co-relation 57158. Up to 7365 conditions per place. [2025-04-13 20:45:33,929 INFO L140 encePairwiseOnDemand]: 15/26 looper letters, 714 selfloop transitions, 233 changer transitions 2/949 dead transitions. [2025-04-13 20:45:33,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 949 transitions, 15306 flow [2025-04-13 20:45:33,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:45:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:45:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2025-04-13 20:45:33,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41923076923076924 [2025-04-13 20:45:33,930 INFO L175 Difference]: Start difference. First operand has 257 places, 849 transitions, 12277 flow. Second operand 20 states and 218 transitions. [2025-04-13 20:45:33,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 949 transitions, 15306 flow [2025-04-13 20:45:34,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 949 transitions, 14854 flow, removed 55 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:34,500 INFO L231 Difference]: Finished difference. Result has 274 places, 885 transitions, 12881 flow [2025-04-13 20:45:34,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11825, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12881, PETRI_PLACES=274, PETRI_TRANSITIONS=885} [2025-04-13 20:45:34,501 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 246 predicate places. [2025-04-13 20:45:34,501 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 885 transitions, 12881 flow [2025-04-13 20:45:34,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:34,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:34,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:34,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:45:34,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:34,701 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:34,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1875951880, now seen corresponding path program 6 times [2025-04-13 20:45:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:34,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94032838] [2025-04-13 20:45:34,702 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:34,706 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:34,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:34,711 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:34,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:34,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94032838] [2025-04-13 20:45:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94032838] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:34,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861391720] [2025-04-13 20:45:34,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:34,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:34,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:34,980 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:34,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:45:35,022 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:45:35,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:35,036 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:45:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:35,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:45:35,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:35,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:45:35,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:35,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-13 20:45:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:35,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:35,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:45:35,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:35,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2025-04-13 20:45:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861391720] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:36,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 20:45:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499096360] [2025-04-13 20:45:36,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:36,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:45:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:45:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:45:36,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:36,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 885 transitions, 12881 flow. Second operand has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:36,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:36,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:36,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:39,698 INFO L116 PetriNetUnfolderBase]: 6244/9065 cut-off events. [2025-04-13 20:45:39,698 INFO L117 PetriNetUnfolderBase]: For 95554/95554 co-relation queries the response was YES. [2025-04-13 20:45:39,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64083 conditions, 9065 events. 6244/9065 cut-off events. For 95554/95554 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 49905 event pairs, 766 based on Foata normal form. 4/9069 useless extension candidates. Maximal degree in co-relation 63667. Up to 8005 conditions per place. [2025-04-13 20:45:39,780 INFO L140 encePairwiseOnDemand]: 13/26 looper letters, 771 selfloop transitions, 345 changer transitions 13/1129 dead transitions. [2025-04-13 20:45:39,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 1129 transitions, 17899 flow [2025-04-13 20:45:39,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:45:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:45:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 461 transitions. [2025-04-13 20:45:39,781 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36939102564102566 [2025-04-13 20:45:39,781 INFO L175 Difference]: Start difference. First operand has 274 places, 885 transitions, 12881 flow. Second operand 48 states and 461 transitions. [2025-04-13 20:45:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 1129 transitions, 17899 flow [2025-04-13 20:45:40,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1129 transitions, 17240 flow, removed 233 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:40,604 INFO L231 Difference]: Finished difference. Result has 330 places, 1003 transitions, 15215 flow [2025-04-13 20:45:40,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12480, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=15215, PETRI_PLACES=330, PETRI_TRANSITIONS=1003} [2025-04-13 20:45:40,605 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 302 predicate places. [2025-04-13 20:45:40,605 INFO L485 AbstractCegarLoop]: Abstraction has has 330 places, 1003 transitions, 15215 flow [2025-04-13 20:45:40,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:40,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:40,605 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:40,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:40,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 20:45:40,807 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:40,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1549977472, now seen corresponding path program 7 times [2025-04-13 20:45:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:40,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505760638] [2025-04-13 20:45:40,808 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:40,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:40,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505760638] [2025-04-13 20:45:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505760638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:40,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947187197] [2025-04-13 20:45:40,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:40,860 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:40,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:45:40,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:40,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:40,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:40,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:40,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:40,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:40,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947187197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:40,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:40,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:45:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482664338] [2025-04-13 20:45:40,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:40,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:45:40,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:40,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:45:40,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:45:40,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:40,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1003 transitions, 15215 flow. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:40,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:40,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:40,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:43,032 INFO L116 PetriNetUnfolderBase]: 7630/11392 cut-off events. [2025-04-13 20:45:43,032 INFO L117 PetriNetUnfolderBase]: For 152101/152101 co-relation queries the response was YES. [2025-04-13 20:45:43,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80687 conditions, 11392 events. 7630/11392 cut-off events. For 152101/152101 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 68907 event pairs, 1989 based on Foata normal form. 564/11956 useless extension candidates. Maximal degree in co-relation 80117. Up to 5367 conditions per place. [2025-04-13 20:45:43,125 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 1135 selfloop transitions, 85 changer transitions 24/1244 dead transitions. [2025-04-13 20:45:43,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1244 transitions, 20854 flow [2025-04-13 20:45:43,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2025-04-13 20:45:43,127 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2025-04-13 20:45:43,127 INFO L175 Difference]: Start difference. First operand has 330 places, 1003 transitions, 15215 flow. Second operand 7 states and 88 transitions. [2025-04-13 20:45:43,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1244 transitions, 20854 flow [2025-04-13 20:45:44,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1244 transitions, 19545 flow, removed 517 selfloop flow, removed 16 redundant places. [2025-04-13 20:45:44,221 INFO L231 Difference]: Finished difference. Result has 323 places, 947 transitions, 13874 flow [2025-04-13 20:45:44,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=13342, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13874, PETRI_PLACES=323, PETRI_TRANSITIONS=947} [2025-04-13 20:45:44,222 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 295 predicate places. [2025-04-13 20:45:44,222 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 947 transitions, 13874 flow [2025-04-13 20:45:44,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:44,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:44,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:44,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:45:44,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:45:44,423 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:44,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2056805262, now seen corresponding path program 7 times [2025-04-13 20:45:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:44,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498242578] [2025-04-13 20:45:44,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:44,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:44,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:44,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:44,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:44,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498242578] [2025-04-13 20:45:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498242578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:44,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714783958] [2025-04-13 20:45:44,483 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:44,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:44,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:44,485 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:44,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:45:44,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:44,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:44,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:44,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:44,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:45:44,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:44,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714783958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:44,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:45:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291543295] [2025-04-13 20:45:44,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:44,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:45:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:44,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:45:44,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:44,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:44,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 947 transitions, 13874 flow. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:44,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:44,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:44,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:46,442 INFO L116 PetriNetUnfolderBase]: 6929/10490 cut-off events. [2025-04-13 20:45:46,443 INFO L117 PetriNetUnfolderBase]: For 136745/136745 co-relation queries the response was YES. [2025-04-13 20:45:46,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75375 conditions, 10490 events. 6929/10490 cut-off events. For 136745/136745 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 64448 event pairs, 1942 based on Foata normal form. 300/10790 useless extension candidates. Maximal degree in co-relation 75061. Up to 5367 conditions per place. [2025-04-13 20:45:46,538 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 935 selfloop transitions, 169 changer transitions 84/1188 dead transitions. [2025-04-13 20:45:46,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 1188 transitions, 19309 flow [2025-04-13 20:45:46,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-04-13 20:45:46,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47802197802197804 [2025-04-13 20:45:46,539 INFO L175 Difference]: Start difference. First operand has 323 places, 947 transitions, 13874 flow. Second operand 7 states and 87 transitions. [2025-04-13 20:45:46,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 1188 transitions, 19309 flow [2025-04-13 20:45:47,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1188 transitions, 19208 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:47,843 INFO L231 Difference]: Finished difference. Result has 321 places, 900 transitions, 13823 flow [2025-04-13 20:45:47,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=13757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13823, PETRI_PLACES=321, PETRI_TRANSITIONS=900} [2025-04-13 20:45:47,845 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 293 predicate places. [2025-04-13 20:45:47,845 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 900 transitions, 13823 flow [2025-04-13 20:45:47,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:47,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:47,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:47,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:48,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:45:48,046 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:48,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1379511654, now seen corresponding path program 8 times [2025-04-13 20:45:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:48,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861921168] [2025-04-13 20:45:48,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:48,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:48,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:48,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:48,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:48,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861921168] [2025-04-13 20:45:48,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861921168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:48,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937021177] [2025-04-13 20:45:48,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:48,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:48,117 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:45:48,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:48,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:48,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:48,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:48,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:48,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:48,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937021177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:48,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:45:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119560127] [2025-04-13 20:45:48,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:48,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:45:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:48,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:45:48,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:45:48,263 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:48,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 900 transitions, 13823 flow. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:48,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:48,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:48,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:49,909 INFO L116 PetriNetUnfolderBase]: 5527/8222 cut-off events. [2025-04-13 20:45:49,910 INFO L117 PetriNetUnfolderBase]: For 139073/139073 co-relation queries the response was YES. [2025-04-13 20:45:49,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64417 conditions, 8222 events. 5527/8222 cut-off events. For 139073/139073 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 46743 event pairs, 1645 based on Foata normal form. 394/8616 useless extension candidates. Maximal degree in co-relation 64127. Up to 4600 conditions per place. [2025-04-13 20:45:49,968 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 845 selfloop transitions, 85 changer transitions 7/937 dead transitions. [2025-04-13 20:45:49,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 937 transitions, 16038 flow [2025-04-13 20:45:49,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:45:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:45:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2025-04-13 20:45:49,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2025-04-13 20:45:49,969 INFO L175 Difference]: Start difference. First operand has 321 places, 900 transitions, 13823 flow. Second operand 8 states and 93 transitions. [2025-04-13 20:45:49,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 937 transitions, 16038 flow [2025-04-13 20:45:50,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 937 transitions, 15799 flow, removed 101 selfloop flow, removed 8 redundant places. [2025-04-13 20:45:50,742 INFO L231 Difference]: Finished difference. Result has 318 places, 836 transitions, 12893 flow [2025-04-13 20:45:50,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12597, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12893, PETRI_PLACES=318, PETRI_TRANSITIONS=836} [2025-04-13 20:45:50,743 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 290 predicate places. [2025-04-13 20:45:50,743 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 836 transitions, 12893 flow [2025-04-13 20:45:50,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:50,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:50,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:50,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:45:50,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:50,943 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:50,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1911325513, now seen corresponding path program 1 times [2025-04-13 20:45:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:50,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174729199] [2025-04-13 20:45:50,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:50,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:50,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:50,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174729199] [2025-04-13 20:45:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174729199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:50,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794245406] [2025-04-13 20:45:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:50,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:50,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:51,004 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:51,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:45:51,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:45:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:51,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:51,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:51,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:45:51,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:51,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794245406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:51,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 20:45:51,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085110808] [2025-04-13 20:45:51,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:51,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:45:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:51,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:45:51,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:45:51,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:51,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 836 transitions, 12893 flow. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:51,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:51,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:51,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:52,443 INFO L116 PetriNetUnfolderBase]: 5614/8391 cut-off events. [2025-04-13 20:45:52,443 INFO L117 PetriNetUnfolderBase]: For 132603/132603 co-relation queries the response was YES. [2025-04-13 20:45:52,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65708 conditions, 8391 events. 5614/8391 cut-off events. For 132603/132603 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 48580 event pairs, 1243 based on Foata normal form. 123/8514 useless extension candidates. Maximal degree in co-relation 65328. Up to 3622 conditions per place. [2025-04-13 20:45:52,516 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 839 selfloop transitions, 163 changer transitions 60/1062 dead transitions. [2025-04-13 20:45:52,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1062 transitions, 17773 flow [2025-04-13 20:45:52,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:45:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:45:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-04-13 20:45:52,517 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2025-04-13 20:45:52,517 INFO L175 Difference]: Start difference. First operand has 318 places, 836 transitions, 12893 flow. Second operand 10 states and 124 transitions. [2025-04-13 20:45:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1062 transitions, 17773 flow [2025-04-13 20:45:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1062 transitions, 17522 flow, removed 39 selfloop flow, removed 7 redundant places. [2025-04-13 20:45:53,485 INFO L231 Difference]: Finished difference. Result has 324 places, 826 transitions, 13059 flow [2025-04-13 20:45:53,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12660, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13059, PETRI_PLACES=324, PETRI_TRANSITIONS=826} [2025-04-13 20:45:53,485 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 296 predicate places. [2025-04-13 20:45:53,485 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 826 transitions, 13059 flow [2025-04-13 20:45:53,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:53,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:53,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:53,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:53,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:45:53,686 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:53,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash -358069877, now seen corresponding path program 2 times [2025-04-13 20:45:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:53,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544346514] [2025-04-13 20:45:53,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:53,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:53,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:53,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:53,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:53,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544346514] [2025-04-13 20:45:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544346514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:53,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82008010] [2025-04-13 20:45:53,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:53,742 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:45:53,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:53,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:53,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:53,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:53,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:45:53,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:53,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82008010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:53,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 20:45:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542170901] [2025-04-13 20:45:53,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:53,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:45:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:53,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:45:53,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:45:53,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:53,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 826 transitions, 13059 flow. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:53,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:53,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:53,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:55,274 INFO L116 PetriNetUnfolderBase]: 5652/8305 cut-off events. [2025-04-13 20:45:55,274 INFO L117 PetriNetUnfolderBase]: For 157870/157870 co-relation queries the response was YES. [2025-04-13 20:45:55,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68254 conditions, 8305 events. 5652/8305 cut-off events. For 157870/157870 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 46451 event pairs, 1291 based on Foata normal form. 135/8440 useless extension candidates. Maximal degree in co-relation 67883. Up to 3622 conditions per place. [2025-04-13 20:45:55,339 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 850 selfloop transitions, 207 changer transitions 45/1102 dead transitions. [2025-04-13 20:45:55,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1102 transitions, 18804 flow [2025-04-13 20:45:55,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:45:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:45:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2025-04-13 20:45:55,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-04-13 20:45:55,340 INFO L175 Difference]: Start difference. First operand has 324 places, 826 transitions, 13059 flow. Second operand 10 states and 117 transitions. [2025-04-13 20:45:55,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 1102 transitions, 18804 flow [2025-04-13 20:45:56,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1102 transitions, 18287 flow, removed 98 selfloop flow, removed 9 redundant places. [2025-04-13 20:45:56,328 INFO L231 Difference]: Finished difference. Result has 325 places, 862 transitions, 13802 flow [2025-04-13 20:45:56,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13802, PETRI_PLACES=325, PETRI_TRANSITIONS=862} [2025-04-13 20:45:56,329 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 297 predicate places. [2025-04-13 20:45:56,329 INFO L485 AbstractCegarLoop]: Abstraction has has 325 places, 862 transitions, 13802 flow [2025-04-13 20:45:56,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:56,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:56,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:56,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:56,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:45:56,530 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:56,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash 107681877, now seen corresponding path program 3 times [2025-04-13 20:45:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:56,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734202073] [2025-04-13 20:45:56,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:56,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:56,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:56,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:56,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734202073] [2025-04-13 20:45:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734202073] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:56,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423218377] [2025-04-13 20:45:56,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:56,586 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:56,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:45:56,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:56,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:45:56,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:45:56,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:56,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:45:56,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:56,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:56,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423218377] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:56,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:56,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:45:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233567172] [2025-04-13 20:45:56,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:56,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:45:56,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:56,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:45:56,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:45:56,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:56,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 862 transitions, 13802 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:56,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:56,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:56,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:58,353 INFO L116 PetriNetUnfolderBase]: 5404/8000 cut-off events. [2025-04-13 20:45:58,353 INFO L117 PetriNetUnfolderBase]: For 180054/180054 co-relation queries the response was YES. [2025-04-13 20:45:58,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67717 conditions, 8000 events. 5404/8000 cut-off events. For 180054/180054 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 45121 event pairs, 1298 based on Foata normal form. 202/8202 useless extension candidates. Maximal degree in co-relation 67347. Up to 3622 conditions per place. [2025-04-13 20:45:58,430 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 832 selfloop transitions, 176 changer transitions 39/1047 dead transitions. [2025-04-13 20:45:58,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1047 transitions, 17911 flow [2025-04-13 20:45:58,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:45:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:45:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2025-04-13 20:45:58,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2025-04-13 20:45:58,431 INFO L175 Difference]: Start difference. First operand has 325 places, 862 transitions, 13802 flow. Second operand 10 states and 115 transitions. [2025-04-13 20:45:58,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1047 transitions, 17911 flow [2025-04-13 20:45:59,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1047 transitions, 17197 flow, removed 124 selfloop flow, removed 9 redundant places. [2025-04-13 20:45:59,548 INFO L231 Difference]: Finished difference. Result has 323 places, 817 transitions, 12779 flow [2025-04-13 20:45:59,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12552, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12779, PETRI_PLACES=323, PETRI_TRANSITIONS=817} [2025-04-13 20:45:59,549 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 295 predicate places. [2025-04-13 20:45:59,549 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 817 transitions, 12779 flow [2025-04-13 20:45:59,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:59,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:59,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:59,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:45:59,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:59,749 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:59,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -451783161, now seen corresponding path program 4 times [2025-04-13 20:45:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:59,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882375234] [2025-04-13 20:45:59,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:59,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:59,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 22 statements. [2025-04-13 20:45:59,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:59,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:59,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882375234] [2025-04-13 20:45:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882375234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:59,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894485500] [2025-04-13 20:45:59,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:59,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:59,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:59,813 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:59,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:45:59,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:45:59,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 22 statements. [2025-04-13 20:45:59,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:59,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:59,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:45:59,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:59,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894485500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:59,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:59,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-13 20:45:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933354185] [2025-04-13 20:45:59,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:59,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:45:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:59,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:45:59,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:45:59,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:45:59,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 817 transitions, 12779 flow. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:59,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:59,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:45:59,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:01,167 INFO L116 PetriNetUnfolderBase]: 5797/8618 cut-off events. [2025-04-13 20:46:01,167 INFO L117 PetriNetUnfolderBase]: For 155520/155520 co-relation queries the response was YES. [2025-04-13 20:46:01,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69904 conditions, 8618 events. 5797/8618 cut-off events. For 155520/155520 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 49844 event pairs, 796 based on Foata normal form. 48/8666 useless extension candidates. Maximal degree in co-relation 69536. Up to 3829 conditions per place. [2025-04-13 20:46:01,245 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 839 selfloop transitions, 316 changer transitions 8/1163 dead transitions. [2025-04-13 20:46:01,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 1163 transitions, 20281 flow [2025-04-13 20:46:01,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:46:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:46:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2025-04-13 20:46:01,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-04-13 20:46:01,246 INFO L175 Difference]: Start difference. First operand has 323 places, 817 transitions, 12779 flow. Second operand 12 states and 140 transitions. [2025-04-13 20:46:01,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 1163 transitions, 20281 flow [2025-04-13 20:46:02,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 1163 transitions, 19537 flow, removed 66 selfloop flow, removed 7 redundant places. [2025-04-13 20:46:02,544 INFO L231 Difference]: Finished difference. Result has 335 places, 887 transitions, 14758 flow [2025-04-13 20:46:02,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12433, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14758, PETRI_PLACES=335, PETRI_TRANSITIONS=887} [2025-04-13 20:46:02,549 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 307 predicate places. [2025-04-13 20:46:02,549 INFO L485 AbstractCegarLoop]: Abstraction has has 335 places, 887 transitions, 14758 flow [2025-04-13 20:46:02,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:02,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:02,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:02,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:46:02,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:02,750 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:02,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1698813157, now seen corresponding path program 5 times [2025-04-13 20:46:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:02,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009045220] [2025-04-13 20:46:02,751 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:02,754 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:02,756 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:02,756 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:02,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:02,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009045220] [2025-04-13 20:46:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009045220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:02,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173879420] [2025-04-13 20:46:02,799 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:02,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:02,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:02,801 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:02,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:46:02,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:02,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:02,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:02,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:46:02,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:02,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173879420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:02,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 20:46:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794129269] [2025-04-13 20:46:02,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:02,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:46:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:02,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:46:02,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:46:02,934 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:02,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 887 transitions, 14758 flow. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:02,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:02,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:02,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:04,752 INFO L116 PetriNetUnfolderBase]: 6080/9087 cut-off events. [2025-04-13 20:46:04,753 INFO L117 PetriNetUnfolderBase]: For 203111/203111 co-relation queries the response was YES. [2025-04-13 20:46:04,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79106 conditions, 9087 events. 6080/9087 cut-off events. For 203111/203111 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 53456 event pairs, 1065 based on Foata normal form. 287/9374 useless extension candidates. Maximal degree in co-relation 78700. Up to 3804 conditions per place. [2025-04-13 20:46:04,847 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 782 selfloop transitions, 181 changer transitions 63/1026 dead transitions. [2025-04-13 20:46:04,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1026 transitions, 18767 flow [2025-04-13 20:46:04,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:46:04,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4576923076923077 [2025-04-13 20:46:04,848 INFO L175 Difference]: Start difference. First operand has 335 places, 887 transitions, 14758 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:46:04,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1026 transitions, 18767 flow [2025-04-13 20:46:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1026 transitions, 18541 flow, removed 86 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:06,289 INFO L231 Difference]: Finished difference. Result has 346 places, 875 transitions, 15183 flow [2025-04-13 20:46:06,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14292, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15183, PETRI_PLACES=346, PETRI_TRANSITIONS=875} [2025-04-13 20:46:06,290 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 318 predicate places. [2025-04-13 20:46:06,290 INFO L485 AbstractCegarLoop]: Abstraction has has 346 places, 875 transitions, 15183 flow [2025-04-13 20:46:06,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:06,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:06,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:06,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:46:06,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:06,491 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:06,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1769943217, now seen corresponding path program 6 times [2025-04-13 20:46:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:06,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133101100] [2025-04-13 20:46:06,492 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:06,496 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:06,499 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:06,499 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:06,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:06,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:06,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133101100] [2025-04-13 20:46:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133101100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:06,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144350481] [2025-04-13 20:46:06,539 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:06,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:06,541 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:06,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:46:06,579 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:06,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:06,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:06,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:46:06,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:06,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144350481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:06,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 20:46:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731323773] [2025-04-13 20:46:06,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:06,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:46:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:06,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:46:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:46:06,708 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:06,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 875 transitions, 15183 flow. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:06,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:06,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:08,241 INFO L116 PetriNetUnfolderBase]: 5551/8368 cut-off events. [2025-04-13 20:46:08,241 INFO L117 PetriNetUnfolderBase]: For 201792/201792 co-relation queries the response was YES. [2025-04-13 20:46:08,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75029 conditions, 8368 events. 5551/8368 cut-off events. For 201792/201792 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 49271 event pairs, 1243 based on Foata normal form. 171/8539 useless extension candidates. Maximal degree in co-relation 74621. Up to 3804 conditions per place. [2025-04-13 20:46:08,328 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 791 selfloop transitions, 138 changer transitions 50/979 dead transitions. [2025-04-13 20:46:08,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 979 transitions, 18640 flow [2025-04-13 20:46:08,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:46:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:46:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2025-04-13 20:46:08,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 20:46:08,329 INFO L175 Difference]: Start difference. First operand has 346 places, 875 transitions, 15183 flow. Second operand 9 states and 104 transitions. [2025-04-13 20:46:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 979 transitions, 18640 flow [2025-04-13 20:46:10,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 979 transitions, 18399 flow, removed 67 selfloop flow, removed 7 redundant places. [2025-04-13 20:46:10,013 INFO L231 Difference]: Finished difference. Result has 345 places, 847 transitions, 15005 flow [2025-04-13 20:46:10,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14574, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15005, PETRI_PLACES=345, PETRI_TRANSITIONS=847} [2025-04-13 20:46:10,014 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 317 predicate places. [2025-04-13 20:46:10,014 INFO L485 AbstractCegarLoop]: Abstraction has has 345 places, 847 transitions, 15005 flow [2025-04-13 20:46:10,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:10,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:10,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:10,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:46:10,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:10,215 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:10,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 487016139, now seen corresponding path program 7 times [2025-04-13 20:46:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:10,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508738029] [2025-04-13 20:46:10,215 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:10,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:10,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:10,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:10,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:10,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508738029] [2025-04-13 20:46:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508738029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:10,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796506585] [2025-04-13 20:46:10,268 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:10,272 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:10,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:46:10,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:46:10,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:10,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:46:10,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:10,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796506585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:10,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:10,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 20:46:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022366053] [2025-04-13 20:46:10,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:10,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:46:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:10,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:46:10,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:46:10,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:10,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 847 transitions, 15005 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:10,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:10,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:10,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:11,788 INFO L116 PetriNetUnfolderBase]: 5152/7823 cut-off events. [2025-04-13 20:46:11,788 INFO L117 PetriNetUnfolderBase]: For 174073/174073 co-relation queries the response was YES. [2025-04-13 20:46:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69623 conditions, 7823 events. 5152/7823 cut-off events. For 174073/174073 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 45957 event pairs, 1089 based on Foata normal form. 234/8057 useless extension candidates. Maximal degree in co-relation 69216. Up to 3804 conditions per place. [2025-04-13 20:46:11,868 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 745 selfloop transitions, 141 changer transitions 42/928 dead transitions. [2025-04-13 20:46:11,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 928 transitions, 17531 flow [2025-04-13 20:46:11,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-04-13 20:46:11,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4346153846153846 [2025-04-13 20:46:11,869 INFO L175 Difference]: Start difference. First operand has 345 places, 847 transitions, 15005 flow. Second operand 10 states and 113 transitions. [2025-04-13 20:46:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 928 transitions, 17531 flow [2025-04-13 20:46:13,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 928 transitions, 17273 flow, removed 98 selfloop flow, removed 8 redundant places. [2025-04-13 20:46:13,439 INFO L231 Difference]: Finished difference. Result has 344 places, 789 transitions, 13954 flow [2025-04-13 20:46:13,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=13419, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13954, PETRI_PLACES=344, PETRI_TRANSITIONS=789} [2025-04-13 20:46:13,440 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 316 predicate places. [2025-04-13 20:46:13,440 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 789 transitions, 13954 flow [2025-04-13 20:46:13,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:13,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:13,440 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:13,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-13 20:46:13,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 20:46:13,641 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:13,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 704308866, now seen corresponding path program 9 times [2025-04-13 20:46:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:13,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026369896] [2025-04-13 20:46:13,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:13,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:13,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:13,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:13,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026369896] [2025-04-13 20:46:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026369896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:13,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274008843] [2025-04-13 20:46:13,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:13,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:13,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:13,686 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:13,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:46:13,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:46:13,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:46:13,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:13,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:46:13,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:13,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:46:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274008843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:13,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:46:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966110732] [2025-04-13 20:46:13,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:13,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:46:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:13,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:46:13,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:46:13,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:13,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 789 transitions, 13954 flow. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:13,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:13,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:13,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:14,657 INFO L116 PetriNetUnfolderBase]: 3312/4983 cut-off events. [2025-04-13 20:46:14,658 INFO L117 PetriNetUnfolderBase]: For 85799/85799 co-relation queries the response was YES. [2025-04-13 20:46:14,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43215 conditions, 4983 events. 3312/4983 cut-off events. For 85799/85799 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 26558 event pairs, 934 based on Foata normal form. 274/5257 useless extension candidates. Maximal degree in co-relation 43098. Up to 3804 conditions per place. [2025-04-13 20:46:14,702 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 472 selfloop transitions, 3 changer transitions 206/681 dead transitions. [2025-04-13 20:46:14,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 681 transitions, 13322 flow [2025-04-13 20:46:14,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:46:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:46:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-13 20:46:14,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 20:46:14,703 INFO L175 Difference]: Start difference. First operand has 344 places, 789 transitions, 13954 flow. Second operand 7 states and 78 transitions. [2025-04-13 20:46:14,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 681 transitions, 13322 flow [2025-04-13 20:46:15,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 681 transitions, 12907 flow, removed 29 selfloop flow, removed 35 redundant places. [2025-04-13 20:46:15,237 INFO L231 Difference]: Finished difference. Result has 284 places, 475 transitions, 7495 flow [2025-04-13 20:46:15,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11492, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7495, PETRI_PLACES=284, PETRI_TRANSITIONS=475} [2025-04-13 20:46:15,238 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 256 predicate places. [2025-04-13 20:46:15,238 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 475 transitions, 7495 flow [2025-04-13 20:46:15,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:15,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:15,238 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:15,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:46:15,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:15,439 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:15,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1532820602, now seen corresponding path program 10 times [2025-04-13 20:46:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:15,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274296006] [2025-04-13 20:46:15,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:15,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:15,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:15,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:15,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274296006] [2025-04-13 20:46:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274296006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:15,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460500485] [2025-04-13 20:46:15,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:15,482 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:46:15,521 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:15,529 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:15,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:15,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:15,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:15,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460500485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:15,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:15,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-04-13 20:46:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035940637] [2025-04-13 20:46:15,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:15,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:46:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:15,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:46:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:46:15,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:15,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 475 transitions, 7495 flow. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:15,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:15,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:16,241 INFO L116 PetriNetUnfolderBase]: 2992/4275 cut-off events. [2025-04-13 20:46:16,241 INFO L117 PetriNetUnfolderBase]: For 70100/70100 co-relation queries the response was YES. [2025-04-13 20:46:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35610 conditions, 4275 events. 2992/4275 cut-off events. For 70100/70100 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 20155 event pairs, 265 based on Foata normal form. 6/4281 useless extension candidates. Maximal degree in co-relation 35517. Up to 2042 conditions per place. [2025-04-13 20:46:16,277 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 494 selfloop transitions, 157 changer transitions 0/651 dead transitions. [2025-04-13 20:46:16,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 651 transitions, 11062 flow [2025-04-13 20:46:16,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:46:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:46:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2025-04-13 20:46:16,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2025-04-13 20:46:16,278 INFO L175 Difference]: Start difference. First operand has 284 places, 475 transitions, 7495 flow. Second operand 12 states and 135 transitions. [2025-04-13 20:46:16,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 651 transitions, 11062 flow [2025-04-13 20:46:16,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 651 transitions, 10489 flow, removed 140 selfloop flow, removed 18 redundant places. [2025-04-13 20:46:16,600 INFO L231 Difference]: Finished difference. Result has 219 places, 528 transitions, 8400 flow [2025-04-13 20:46:16,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=7082, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8400, PETRI_PLACES=219, PETRI_TRANSITIONS=528} [2025-04-13 20:46:16,601 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 191 predicate places. [2025-04-13 20:46:16,601 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 528 transitions, 8400 flow [2025-04-13 20:46:16,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:16,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:16,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:16,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:46:16,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:16,802 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:16,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1762424381, now seen corresponding path program 8 times [2025-04-13 20:46:16,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:16,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292254704] [2025-04-13 20:46:16,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:16,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:16,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:16,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:16,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:16,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292254704] [2025-04-13 20:46:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292254704] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:16,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982115382] [2025-04-13 20:46:16,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:16,857 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:46:16,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:16,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:16,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:16,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:16,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:16,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:16,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982115382] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:17,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 20:46:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22350785] [2025-04-13 20:46:17,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:17,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:46:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:17,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:46:17,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:46:17,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:17,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 528 transitions, 8400 flow. Second operand has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:17,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:17,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:17,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:17,711 INFO L116 PetriNetUnfolderBase]: 3447/4949 cut-off events. [2025-04-13 20:46:17,711 INFO L117 PetriNetUnfolderBase]: For 90629/90629 co-relation queries the response was YES. [2025-04-13 20:46:17,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41446 conditions, 4949 events. 3447/4949 cut-off events. For 90629/90629 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 24140 event pairs, 320 based on Foata normal form. 44/4993 useless extension candidates. Maximal degree in co-relation 41355. Up to 1917 conditions per place. [2025-04-13 20:46:17,749 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 574 selfloop transitions, 210 changer transitions 0/784 dead transitions. [2025-04-13 20:46:17,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 784 transitions, 14064 flow [2025-04-13 20:46:17,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2025-04-13 20:46:17,750 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38076923076923075 [2025-04-13 20:46:17,750 INFO L175 Difference]: Start difference. First operand has 219 places, 528 transitions, 8400 flow. Second operand 10 states and 99 transitions. [2025-04-13 20:46:17,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 784 transitions, 14064 flow [2025-04-13 20:46:18,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 784 transitions, 13686 flow, removed 82 selfloop flow, removed 3 redundant places. [2025-04-13 20:46:18,087 INFO L231 Difference]: Finished difference. Result has 228 places, 555 transitions, 9350 flow [2025-04-13 20:46:18,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8119, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9350, PETRI_PLACES=228, PETRI_TRANSITIONS=555} [2025-04-13 20:46:18,088 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 200 predicate places. [2025-04-13 20:46:18,088 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 555 transitions, 9350 flow [2025-04-13 20:46:18,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:18,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:18,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:18,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:46:18,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:46:18,289 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:18,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 115012451, now seen corresponding path program 9 times [2025-04-13 20:46:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:18,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894747500] [2025-04-13 20:46:18,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:18,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:18,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:18,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:18,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:18,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894747500] [2025-04-13 20:46:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894747500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:18,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266823917] [2025-04-13 20:46:18,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:18,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:18,352 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:18,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:46:18,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:18,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:18,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:18,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:18,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:18,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:18,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266823917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:18,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 20:46:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477436085] [2025-04-13 20:46:18,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:18,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:46:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:46:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:46:18,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:18,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 555 transitions, 9350 flow. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:18,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:18,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:18,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:19,385 INFO L116 PetriNetUnfolderBase]: 3874/5620 cut-off events. [2025-04-13 20:46:19,385 INFO L117 PetriNetUnfolderBase]: For 106864/106864 co-relation queries the response was YES. [2025-04-13 20:46:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48563 conditions, 5620 events. 3874/5620 cut-off events. For 106864/106864 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 28600 event pairs, 624 based on Foata normal form. 73/5693 useless extension candidates. Maximal degree in co-relation 48470. Up to 3158 conditions per place. [2025-04-13 20:46:19,432 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 604 selfloop transitions, 326 changer transitions 0/930 dead transitions. [2025-04-13 20:46:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 930 transitions, 16940 flow [2025-04-13 20:46:19,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:46:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:46:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2025-04-13 20:46:19,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38221153846153844 [2025-04-13 20:46:19,433 INFO L175 Difference]: Start difference. First operand has 228 places, 555 transitions, 9350 flow. Second operand 16 states and 159 transitions. [2025-04-13 20:46:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 930 transitions, 16940 flow [2025-04-13 20:46:19,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 930 transitions, 16517 flow, removed 98 selfloop flow, removed 6 redundant places. [2025-04-13 20:46:19,907 INFO L231 Difference]: Finished difference. Result has 241 places, 668 transitions, 11879 flow [2025-04-13 20:46:19,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=9057, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11879, PETRI_PLACES=241, PETRI_TRANSITIONS=668} [2025-04-13 20:46:19,907 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 213 predicate places. [2025-04-13 20:46:19,907 INFO L485 AbstractCegarLoop]: Abstraction has has 241 places, 668 transitions, 11879 flow [2025-04-13 20:46:19,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:19,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:19,907 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:19,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-13 20:46:20,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:46:20,108 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:20,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 328393841, now seen corresponding path program 10 times [2025-04-13 20:46:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:20,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191159149] [2025-04-13 20:46:20,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:20,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:20,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:20,113 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:20,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:20,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191159149] [2025-04-13 20:46:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191159149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:20,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944639921] [2025-04-13 20:46:20,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:20,144 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:20,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:46:20,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:20,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:20,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:20,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:20,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:20,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944639921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:20,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:20,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-04-13 20:46:20,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117652879] [2025-04-13 20:46:20,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:20,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:46:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:20,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:46:20,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:46:20,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:20,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 668 transitions, 11879 flow. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:20,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:20,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:20,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:21,381 INFO L116 PetriNetUnfolderBase]: 4265/6231 cut-off events. [2025-04-13 20:46:21,381 INFO L117 PetriNetUnfolderBase]: For 127370/127370 co-relation queries the response was YES. [2025-04-13 20:46:21,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56442 conditions, 6231 events. 4265/6231 cut-off events. For 127370/127370 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 32554 event pairs, 175 based on Foata normal form. 8/6239 useless extension candidates. Maximal degree in co-relation 56345. Up to 2407 conditions per place. [2025-04-13 20:46:21,437 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 685 selfloop transitions, 215 changer transitions 0/900 dead transitions. [2025-04-13 20:46:21,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 900 transitions, 17416 flow [2025-04-13 20:46:21,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:46:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:46:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2025-04-13 20:46:21,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 20:46:21,438 INFO L175 Difference]: Start difference. First operand has 241 places, 668 transitions, 11879 flow. Second operand 14 states and 156 transitions. [2025-04-13 20:46:21,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 900 transitions, 17416 flow [2025-04-13 20:46:22,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 900 transitions, 16301 flow, removed 317 selfloop flow, removed 8 redundant places. [2025-04-13 20:46:22,082 INFO L231 Difference]: Finished difference. Result has 254 places, 721 transitions, 12578 flow [2025-04-13 20:46:22,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11082, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12578, PETRI_PLACES=254, PETRI_TRANSITIONS=721} [2025-04-13 20:46:22,082 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 226 predicate places. [2025-04-13 20:46:22,082 INFO L485 AbstractCegarLoop]: Abstraction has has 254 places, 721 transitions, 12578 flow [2025-04-13 20:46:22,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:22,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:22,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:22,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:46:22,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:46:22,283 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:22,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash 678760435, now seen corresponding path program 11 times [2025-04-13 20:46:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:22,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783141107] [2025-04-13 20:46:22,284 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:22,288 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:22,291 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:22,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:22,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:22,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783141107] [2025-04-13 20:46:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783141107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:22,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658899432] [2025-04-13 20:46:22,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:22,340 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 20:46:22,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:22,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:22,396 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:22,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:22,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:22,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658899432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:22,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2025-04-13 20:46:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798187097] [2025-04-13 20:46:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:22,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:46:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:22,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:46:22,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:46:22,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:22,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 721 transitions, 12578 flow. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:22,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:22,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:22,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:23,815 INFO L116 PetriNetUnfolderBase]: 4199/6103 cut-off events. [2025-04-13 20:46:23,815 INFO L117 PetriNetUnfolderBase]: For 129360/129360 co-relation queries the response was YES. [2025-04-13 20:46:23,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56215 conditions, 6103 events. 4199/6103 cut-off events. For 129360/129360 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 31603 event pairs, 263 based on Foata normal form. 94/6197 useless extension candidates. Maximal degree in co-relation 56110. Up to 2357 conditions per place. [2025-04-13 20:46:23,871 INFO L140 encePairwiseOnDemand]: 14/26 looper letters, 489 selfloop transitions, 579 changer transitions 0/1068 dead transitions. [2025-04-13 20:46:23,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1068 transitions, 19933 flow [2025-04-13 20:46:23,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 20:46:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 20:46:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 322 transitions. [2025-04-13 20:46:23,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2025-04-13 20:46:23,873 INFO L175 Difference]: Start difference. First operand has 254 places, 721 transitions, 12578 flow. Second operand 35 states and 322 transitions. [2025-04-13 20:46:23,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1068 transitions, 19933 flow [2025-04-13 20:46:24,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1068 transitions, 19329 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-13 20:46:24,541 INFO L231 Difference]: Finished difference. Result has 282 places, 851 transitions, 15492 flow [2025-04-13 20:46:24,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12027, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=437, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=15492, PETRI_PLACES=282, PETRI_TRANSITIONS=851} [2025-04-13 20:46:24,541 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 254 predicate places. [2025-04-13 20:46:24,541 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 851 transitions, 15492 flow [2025-04-13 20:46:24,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:24,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:24,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:24,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 20:46:24,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 20:46:24,742 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:24,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash 416889971, now seen corresponding path program 12 times [2025-04-13 20:46:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:24,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907707282] [2025-04-13 20:46:24,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:24,746 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:24,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:24,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:24,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:24,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:24,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907707282] [2025-04-13 20:46:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907707282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:24,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907743215] [2025-04-13 20:46:24,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:24,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:24,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:24,808 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:24,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 20:46:24,853 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:24,868 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:24,869 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:24,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:24,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:24,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907743215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:25,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-13 20:46:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86055435] [2025-04-13 20:46:25,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:25,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:46:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:46:25,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:46:25,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:25,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 851 transitions, 15492 flow. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:25,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:25,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:26,104 INFO L116 PetriNetUnfolderBase]: 4259/6209 cut-off events. [2025-04-13 20:46:26,105 INFO L117 PetriNetUnfolderBase]: For 130007/130007 co-relation queries the response was YES. [2025-04-13 20:46:26,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58371 conditions, 6209 events. 4259/6209 cut-off events. For 130007/130007 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 32171 event pairs, 579 based on Foata normal form. 46/6255 useless extension candidates. Maximal degree in co-relation 58267. Up to 3007 conditions per place. [2025-04-13 20:46:26,162 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 597 selfloop transitions, 399 changer transitions 0/996 dead transitions. [2025-04-13 20:46:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 996 transitions, 19510 flow [2025-04-13 20:46:26,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:46:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:46:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2025-04-13 20:46:26,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35502958579881655 [2025-04-13 20:46:26,163 INFO L175 Difference]: Start difference. First operand has 282 places, 851 transitions, 15492 flow. Second operand 13 states and 120 transitions. [2025-04-13 20:46:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 996 transitions, 19510 flow [2025-04-13 20:46:27,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 996 transitions, 18285 flow, removed 277 selfloop flow, removed 12 redundant places. [2025-04-13 20:46:27,135 INFO L231 Difference]: Finished difference. Result has 283 places, 863 transitions, 15344 flow [2025-04-13 20:46:27,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14359, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15344, PETRI_PLACES=283, PETRI_TRANSITIONS=863} [2025-04-13 20:46:27,136 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 255 predicate places. [2025-04-13 20:46:27,136 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 863 transitions, 15344 flow [2025-04-13 20:46:27,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:27,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:27,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:27,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 20:46:27,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:27,337 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:27,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1839817454, now seen corresponding path program 11 times [2025-04-13 20:46:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:27,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470971986] [2025-04-13 20:46:27,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:27,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:27,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:27,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:27,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470971986] [2025-04-13 20:46:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470971986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:27,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058629802] [2025-04-13 20:46:27,390 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:27,392 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:27,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 20:46:27,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:27,445 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:27,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:27,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:27,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:27,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058629802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:27,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-04-13 20:46:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47187087] [2025-04-13 20:46:27,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:27,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:46:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:46:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:46:27,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:27,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 863 transitions, 15344 flow. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:27,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:27,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:29,451 INFO L116 PetriNetUnfolderBase]: 5428/7963 cut-off events. [2025-04-13 20:46:29,451 INFO L117 PetriNetUnfolderBase]: For 168338/168338 co-relation queries the response was YES. [2025-04-13 20:46:29,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75423 conditions, 7963 events. 5428/7963 cut-off events. For 168338/168338 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 43586 event pairs, 158 based on Foata normal form. 81/8044 useless extension candidates. Maximal degree in co-relation 75321. Up to 3002 conditions per place. [2025-04-13 20:46:29,525 INFO L140 encePairwiseOnDemand]: 14/26 looper letters, 496 selfloop transitions, 891 changer transitions 0/1387 dead transitions. [2025-04-13 20:46:29,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 1387 transitions, 26306 flow [2025-04-13 20:46:29,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 20:46:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-13 20:46:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 413 transitions. [2025-04-13 20:46:29,526 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.361013986013986 [2025-04-13 20:46:29,526 INFO L175 Difference]: Start difference. First operand has 283 places, 863 transitions, 15344 flow. Second operand 44 states and 413 transitions. [2025-04-13 20:46:29,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 1387 transitions, 26306 flow [2025-04-13 20:46:30,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 1387 transitions, 25573 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-04-13 20:46:30,622 INFO L231 Difference]: Finished difference. Result has 328 places, 1129 transitions, 21820 flow [2025-04-13 20:46:30,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14656, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=639, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=21820, PETRI_PLACES=328, PETRI_TRANSITIONS=1129} [2025-04-13 20:46:30,622 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 300 predicate places. [2025-04-13 20:46:30,623 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 1129 transitions, 21820 flow [2025-04-13 20:46:30,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:30,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:30,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:30,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 20:46:30,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-13 20:46:30,823 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:30,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1872047538, now seen corresponding path program 12 times [2025-04-13 20:46:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:30,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629237436] [2025-04-13 20:46:30,824 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:30,828 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:30,830 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:30,830 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:30,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629237436] [2025-04-13 20:46:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629237436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:30,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548976398] [2025-04-13 20:46:30,875 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:30,877 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 20:46:30,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:30,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:30,998 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:46:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:30,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:31,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:31,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548976398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:31,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 20:46:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355332507] [2025-04-13 20:46:31,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:31,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:46:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:46:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:46:31,154 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:31,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1129 transitions, 21820 flow. Second operand has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:31,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:31,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:31,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:32,865 INFO L116 PetriNetUnfolderBase]: 5460/8015 cut-off events. [2025-04-13 20:46:32,866 INFO L117 PetriNetUnfolderBase]: For 182299/182299 co-relation queries the response was YES. [2025-04-13 20:46:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80294 conditions, 8015 events. 5460/8015 cut-off events. For 182299/182299 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 44071 event pairs, 995 based on Foata normal form. 38/8053 useless extension candidates. Maximal degree in co-relation 80180. Up to 5173 conditions per place. [2025-04-13 20:46:32,935 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 962 selfloop transitions, 272 changer transitions 0/1234 dead transitions. [2025-04-13 20:46:32,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1234 transitions, 26210 flow [2025-04-13 20:46:32,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-04-13 20:46:32,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2025-04-13 20:46:32,936 INFO L175 Difference]: Start difference. First operand has 328 places, 1129 transitions, 21820 flow. Second operand 10 states and 94 transitions. [2025-04-13 20:46:32,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1234 transitions, 26210 flow [2025-04-13 20:46:34,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 1234 transitions, 22834 flow, removed 1012 selfloop flow, removed 13 redundant places. [2025-04-13 20:46:34,432 INFO L231 Difference]: Finished difference. Result has 320 places, 1128 transitions, 19488 flow [2025-04-13 20:46:34,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=18786, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19488, PETRI_PLACES=320, PETRI_TRANSITIONS=1128} [2025-04-13 20:46:34,433 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 292 predicate places. [2025-04-13 20:46:34,433 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 1128 transitions, 19488 flow [2025-04-13 20:46:34,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:34,433 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:34,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 20:46:34,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 20:46:34,634 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:34,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1129770567, now seen corresponding path program 13 times [2025-04-13 20:46:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:34,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308941365] [2025-04-13 20:46:34,634 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:34,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:46:34,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:34,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:34,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:34,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308941365] [2025-04-13 20:46:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308941365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:34,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370305005] [2025-04-13 20:46:34,713 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:34,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:34,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:34,715 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:34,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 20:46:34,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:46:34,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:34,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:34,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370305005] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:34,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:34,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-13 20:46:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101425734] [2025-04-13 20:46:34,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:34,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:46:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:34,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:46:34,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:46:34,946 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:34,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1128 transitions, 19488 flow. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:34,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:34,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:36,683 INFO L116 PetriNetUnfolderBase]: 5579/8148 cut-off events. [2025-04-13 20:46:36,683 INFO L117 PetriNetUnfolderBase]: For 144234/144234 co-relation queries the response was YES. [2025-04-13 20:46:36,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72155 conditions, 8148 events. 5579/8148 cut-off events. For 144234/144234 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 44417 event pairs, 847 based on Foata normal form. 98/8246 useless extension candidates. Maximal degree in co-relation 72048. Up to 4699 conditions per place. [2025-04-13 20:46:36,753 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 804 selfloop transitions, 545 changer transitions 0/1349 dead transitions. [2025-04-13 20:46:36,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1349 transitions, 25182 flow [2025-04-13 20:46:36,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:46:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:46:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2025-04-13 20:46:36,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3798076923076923 [2025-04-13 20:46:36,754 INFO L175 Difference]: Start difference. First operand has 320 places, 1128 transitions, 19488 flow. Second operand 16 states and 158 transitions. [2025-04-13 20:46:36,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1349 transitions, 25182 flow [2025-04-13 20:46:37,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 1349 transitions, 24477 flow, removed 73 selfloop flow, removed 9 redundant places. [2025-04-13 20:46:37,957 INFO L231 Difference]: Finished difference. Result has 330 places, 1203 transitions, 21234 flow [2025-04-13 20:46:37,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=18708, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=21234, PETRI_PLACES=330, PETRI_TRANSITIONS=1203} [2025-04-13 20:46:37,958 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 302 predicate places. [2025-04-13 20:46:37,958 INFO L485 AbstractCegarLoop]: Abstraction has has 330 places, 1203 transitions, 21234 flow [2025-04-13 20:46:37,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:37,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:37,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:37,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 20:46:38,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 20:46:38,159 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:38,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 599775340, now seen corresponding path program 13 times [2025-04-13 20:46:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:38,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339581551] [2025-04-13 20:46:38,160 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:38,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:46:38,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:38,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:38,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:38,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339581551] [2025-04-13 20:46:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339581551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:38,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168730830] [2025-04-13 20:46:38,212 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:38,213 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:38,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 20:46:38,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:46:38,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:38,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:38,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:38,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:38,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168730830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:38,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:38,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 20:46:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687294507] [2025-04-13 20:46:38,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:38,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:46:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:38,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:46:38,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:46:38,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:38,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1203 transitions, 21234 flow. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:38,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:38,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:38,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:40,189 INFO L116 PetriNetUnfolderBase]: 5624/8223 cut-off events. [2025-04-13 20:46:40,189 INFO L117 PetriNetUnfolderBase]: For 145314/145314 co-relation queries the response was YES. [2025-04-13 20:46:40,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73775 conditions, 8223 events. 5624/8223 cut-off events. For 145314/145314 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 45189 event pairs, 1248 based on Foata normal form. 34/8257 useless extension candidates. Maximal degree in co-relation 73665. Up to 6683 conditions per place. [2025-04-13 20:46:40,256 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 971 selfloop transitions, 303 changer transitions 0/1274 dead transitions. [2025-04-13 20:46:40,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1274 transitions, 24766 flow [2025-04-13 20:46:40,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:46:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:46:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2025-04-13 20:46:40,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2025-04-13 20:46:40,257 INFO L175 Difference]: Start difference. First operand has 330 places, 1203 transitions, 21234 flow. Second operand 11 states and 99 transitions. [2025-04-13 20:46:40,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1274 transitions, 24766 flow [2025-04-13 20:46:41,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1274 transitions, 24190 flow, removed 34 selfloop flow, removed 8 redundant places. [2025-04-13 20:46:41,399 INFO L231 Difference]: Finished difference. Result has 333 places, 1211 transitions, 21417 flow [2025-04-13 20:46:41,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20658, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21417, PETRI_PLACES=333, PETRI_TRANSITIONS=1211} [2025-04-13 20:46:41,400 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 305 predicate places. [2025-04-13 20:46:41,400 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 1211 transitions, 21417 flow [2025-04-13 20:46:41,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:41,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:41,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:41,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 20:46:41,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:41,601 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:41,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1215063374, now seen corresponding path program 14 times [2025-04-13 20:46:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:41,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765448695] [2025-04-13 20:46:41,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:41,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:41,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:41,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:41,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:41,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765448695] [2025-04-13 20:46:41,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765448695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:41,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931468394] [2025-04-13 20:46:41,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:41,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:41,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:41,749 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:41,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 20:46:41,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:41,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:41,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:41,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931468394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:42,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-13 20:46:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477149237] [2025-04-13 20:46:42,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:42,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:46:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:42,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:46:42,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:46:42,001 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:42,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1211 transitions, 21417 flow. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:42,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:42,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:43,727 INFO L116 PetriNetUnfolderBase]: 5567/8124 cut-off events. [2025-04-13 20:46:43,727 INFO L117 PetriNetUnfolderBase]: For 144526/144526 co-relation queries the response was YES. [2025-04-13 20:46:43,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73522 conditions, 8124 events. 5567/8124 cut-off events. For 144526/144526 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 44271 event pairs, 398 based on Foata normal form. 38/8162 useless extension candidates. Maximal degree in co-relation 73411. Up to 2904 conditions per place. [2025-04-13 20:46:43,917 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 722 selfloop transitions, 658 changer transitions 0/1380 dead transitions. [2025-04-13 20:46:43,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1380 transitions, 26675 flow [2025-04-13 20:46:43,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:46:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:46:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 198 transitions. [2025-04-13 20:46:43,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4008097165991903 [2025-04-13 20:46:43,918 INFO L175 Difference]: Start difference. First operand has 333 places, 1211 transitions, 21417 flow. Second operand 19 states and 198 transitions. [2025-04-13 20:46:43,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1380 transitions, 26675 flow [2025-04-13 20:46:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1380 transitions, 26036 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-04-13 20:46:45,055 INFO L231 Difference]: Finished difference. Result has 343 places, 1203 transitions, 22160 flow [2025-04-13 20:46:45,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20622, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=654, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=22160, PETRI_PLACES=343, PETRI_TRANSITIONS=1203} [2025-04-13 20:46:45,056 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 315 predicate places. [2025-04-13 20:46:45,056 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 1203 transitions, 22160 flow [2025-04-13 20:46:45,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:45,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:45,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:45,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 20:46:45,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:45,257 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:45,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -559045026, now seen corresponding path program 15 times [2025-04-13 20:46:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:45,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588415098] [2025-04-13 20:46:45,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:45,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:45,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:45,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:45,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:45,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588415098] [2025-04-13 20:46:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588415098] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:45,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772320723] [2025-04-13 20:46:45,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:45,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:45,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:45,324 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 20:46:45,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:45,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:45,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:45,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:45,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:45,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:45,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772320723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:45,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:45,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 20:46:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058965364] [2025-04-13 20:46:45,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:45,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:46:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:45,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:46:45,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:46:45,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:45,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1203 transitions, 22160 flow. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:45,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:45,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:45,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:47,277 INFO L116 PetriNetUnfolderBase]: 5605/8186 cut-off events. [2025-04-13 20:46:47,278 INFO L117 PetriNetUnfolderBase]: For 153577/153577 co-relation queries the response was YES. [2025-04-13 20:46:47,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75835 conditions, 8186 events. 5605/8186 cut-off events. For 153577/153577 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 44492 event pairs, 513 based on Foata normal form. 31/8217 useless extension candidates. Maximal degree in co-relation 75723. Up to 2883 conditions per place. [2025-04-13 20:46:47,354 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 766 selfloop transitions, 505 changer transitions 0/1271 dead transitions. [2025-04-13 20:46:47,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1271 transitions, 25697 flow [2025-04-13 20:46:47,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-04-13 20:46:47,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2025-04-13 20:46:47,355 INFO L175 Difference]: Start difference. First operand has 343 places, 1203 transitions, 22160 flow. Second operand 10 states and 94 transitions. [2025-04-13 20:46:47,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 1271 transitions, 25697 flow [2025-04-13 20:46:48,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1271 transitions, 24268 flow, removed 4 selfloop flow, removed 20 redundant places. [2025-04-13 20:46:48,774 INFO L231 Difference]: Finished difference. Result has 331 places, 1190 transitions, 21500 flow [2025-04-13 20:46:48,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20490, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21500, PETRI_PLACES=331, PETRI_TRANSITIONS=1190} [2025-04-13 20:46:48,775 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 303 predicate places. [2025-04-13 20:46:48,775 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 1190 transitions, 21500 flow [2025-04-13 20:46:48,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:48,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:48,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:48,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 20:46:48,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 20:46:48,976 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:48,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -775367300, now seen corresponding path program 16 times [2025-04-13 20:46:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:48,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704800630] [2025-04-13 20:46:48,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:48,982 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:48,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:48,984 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:48,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:49,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704800630] [2025-04-13 20:46:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704800630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:49,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738641015] [2025-04-13 20:46:49,021 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:49,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:49,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:49,024 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:49,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 20:46:49,069 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:49,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-04-13 20:46:49,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:46:49,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:49,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:49,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:49,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738641015] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:49,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-04-13 20:46:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250768492] [2025-04-13 20:46:49,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:49,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:46:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:49,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:46:49,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:46:49,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:49,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1190 transitions, 21500 flow. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:49,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:49,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:49,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:50,990 INFO L116 PetriNetUnfolderBase]: 5621/8214 cut-off events. [2025-04-13 20:46:50,990 INFO L117 PetriNetUnfolderBase]: For 149845/149845 co-relation queries the response was YES. [2025-04-13 20:46:51,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75194 conditions, 8214 events. 5621/8214 cut-off events. For 149845/149845 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 44849 event pairs, 343 based on Foata normal form. 12/8226 useless extension candidates. Maximal degree in co-relation 75085. Up to 2891 conditions per place. [2025-04-13 20:46:51,075 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 960 selfloop transitions, 417 changer transitions 0/1377 dead transitions. [2025-04-13 20:46:51,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1377 transitions, 27010 flow [2025-04-13 20:46:51,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:46:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:46:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 190 transitions. [2025-04-13 20:46:51,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2025-04-13 20:46:51,076 INFO L175 Difference]: Start difference. First operand has 331 places, 1190 transitions, 21500 flow. Second operand 18 states and 190 transitions. [2025-04-13 20:46:51,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1377 transitions, 27010 flow [2025-04-13 20:46:52,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 1377 transitions, 26094 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:46:52,430 INFO L231 Difference]: Finished difference. Result has 348 places, 1203 transitions, 21867 flow [2025-04-13 20:46:52,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20635, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=21867, PETRI_PLACES=348, PETRI_TRANSITIONS=1203} [2025-04-13 20:46:52,431 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 320 predicate places. [2025-04-13 20:46:52,431 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 1203 transitions, 21867 flow [2025-04-13 20:46:52,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:52,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:52,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:52,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 20:46:52,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 20:46:52,632 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:52,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1267732813, now seen corresponding path program 14 times [2025-04-13 20:46:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:52,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336448978] [2025-04-13 20:46:52,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:52,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:52,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:52,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:52,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:52,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336448978] [2025-04-13 20:46:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336448978] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:52,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328458681] [2025-04-13 20:46:52,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:52,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:52,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:52,699 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:52,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 20:46:52,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:52,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:52,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:52,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:52,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:46:52,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:52,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328458681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:52,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 20:46:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862158970] [2025-04-13 20:46:52,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:52,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:46:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:46:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:46:52,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:52,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1203 transitions, 21867 flow. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:52,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:52,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:52,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:54,641 INFO L116 PetriNetUnfolderBase]: 5570/8113 cut-off events. [2025-04-13 20:46:54,641 INFO L117 PetriNetUnfolderBase]: For 153345/153345 co-relation queries the response was YES. [2025-04-13 20:46:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75568 conditions, 8113 events. 5570/8113 cut-off events. For 153345/153345 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 43894 event pairs, 953 based on Foata normal form. 38/8151 useless extension candidates. Maximal degree in co-relation 75451. Up to 5008 conditions per place. [2025-04-13 20:46:54,718 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 854 selfloop transitions, 398 changer transitions 0/1252 dead transitions. [2025-04-13 20:46:54,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1252 transitions, 25003 flow [2025-04-13 20:46:54,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2025-04-13 20:46:54,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3423076923076923 [2025-04-13 20:46:54,719 INFO L175 Difference]: Start difference. First operand has 348 places, 1203 transitions, 21867 flow. Second operand 10 states and 89 transitions. [2025-04-13 20:46:54,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1252 transitions, 25003 flow [2025-04-13 20:46:56,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1252 transitions, 24262 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-13 20:46:56,139 INFO L231 Difference]: Finished difference. Result has 351 places, 1196 transitions, 21861 flow [2025-04-13 20:46:56,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=21065, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=398, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21861, PETRI_PLACES=351, PETRI_TRANSITIONS=1196} [2025-04-13 20:46:56,139 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 323 predicate places. [2025-04-13 20:46:56,140 INFO L485 AbstractCegarLoop]: Abstraction has has 351 places, 1196 transitions, 21861 flow [2025-04-13 20:46:56,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:56,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:56,140 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:56,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 20:46:56,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 20:46:56,340 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:56,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1897534038, now seen corresponding path program 17 times [2025-04-13 20:46:56,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:56,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884852812] [2025-04-13 20:46:56,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:56,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:56,349 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:56,349 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:46:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:56,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884852812] [2025-04-13 20:46:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884852812] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:56,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479996043] [2025-04-13 20:46:56,391 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:56,393 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:56,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 20:46:56,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:46:56,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:46:56,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:56,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:56,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:56,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:56,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479996043] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:56,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-04-13 20:46:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600410883] [2025-04-13 20:46:56,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:56,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:46:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:56,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:46:56,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:46:56,564 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-04-13 20:46:56,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1196 transitions, 21861 flow. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:56,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:56,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-04-13 20:46:56,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:59,031 INFO L116 PetriNetUnfolderBase]: 5710/8319 cut-off events. [2025-04-13 20:46:59,031 INFO L117 PetriNetUnfolderBase]: For 155615/155615 co-relation queries the response was YES. [2025-04-13 20:46:59,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77384 conditions, 8319 events. 5710/8319 cut-off events. For 155615/155615 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 45273 event pairs, 391 based on Foata normal form. 52/8371 useless extension candidates. Maximal degree in co-relation 77267. Up to 2955 conditions per place. [2025-04-13 20:46:59,106 INFO L140 encePairwiseOnDemand]: 14/26 looper letters, 621 selfloop transitions, 811 changer transitions 0/1432 dead transitions. [2025-04-13 20:46:59,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1432 transitions, 27870 flow [2025-04-13 20:46:59,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:46:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:46:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 318 transitions. [2025-04-13 20:46:59,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3305613305613306 [2025-04-13 20:46:59,108 INFO L175 Difference]: Start difference. First operand has 351 places, 1196 transitions, 21861 flow. Second operand 37 states and 318 transitions. [2025-04-13 20:46:59,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1432 transitions, 27870 flow [2025-04-13 20:47:00,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1432 transitions, 26936 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-04-13 20:47:00,371 INFO L231 Difference]: Finished difference. Result has 385 places, 1265 transitions, 24101 flow [2025-04-13 20:47:00,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20946, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=741, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=24101, PETRI_PLACES=385, PETRI_TRANSITIONS=1265} [2025-04-13 20:47:00,372 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 357 predicate places. [2025-04-13 20:47:00,372 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 1265 transitions, 24101 flow [2025-04-13 20:47:00,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:00,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:00,372 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:00,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 20:47:00,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:00,573 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:00,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:00,574 INFO L85 PathProgramCache]: Analyzing trace with hash 159906743, now seen corresponding path program 8 times [2025-04-13 20:47:00,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:00,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916153264] [2025-04-13 20:47:00,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:00,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:00,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:00,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:00,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:01,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916153264] [2025-04-13 20:47:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916153264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:01,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563253900] [2025-04-13 20:47:01,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:47:01,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:01,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:01,114 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 20:47:01,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:47:01,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:47:01,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:01,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:01,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 20:47:01,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:01,211 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:47:01,447 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:01,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2025-04-13 20:47:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:01,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:02,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-04-13 20:47:02,028 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:02,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 202 [2025-04-13 20:47:10,352 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:10,465 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:10,530 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:10,583 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:10,868 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:11,037 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:11,574 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:14,520 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:14,620 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:14,724 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:14,775 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:14,830 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:14,989 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,160 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,341 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,387 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,436 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:15,519 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,568 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,615 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:15,730 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,804 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:15,894 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:47:15,960 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:16,023 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:16,106 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:47:16,174 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:16,231 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:16,372 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:16,435 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:16,496 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:17,919 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:43,218 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:48,191 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:49,705 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:49,804 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:49,872 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:50,072 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:47:55,949 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:57,046 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:57,109 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:57,546 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:47:57,559 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:48:25,535 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 50 DAG size of output: 25 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 20:50:54,849 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:51:38,092 WARN L286 SmtUtils]: Spent 21.06s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 20:52:17,121 WARN L286 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 82 DAG size of output: 38 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 20:52:38,940 WARN L286 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 89 DAG size of output: 64 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 20:53:49,853 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:54:10,445 WARN L286 SmtUtils]: Spent 16.20s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:54:26,169 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:56:42,569 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:58:02,385 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 19 DAG size of output: 1 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:58:22,402 WARN L286 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 29 DAG size of output: 25 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 20:58:44,999 WARN L286 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:59:08,609 WARN L286 SmtUtils]: Spent 10.50s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 20:59:14,013 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:59:14,049 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:59:15,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 20:59:15,213 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:59:15,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:59:15,301 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:59:15,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 20:59:15,301 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2025-04-13 20:59:15,302 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:59:15,302 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:59:15,302 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:59:15,303 INFO L422 BasicCegarLoop]: Path program histogram: [17, 14, 8, 7, 1, 1, 1, 1, 1] [2025-04-13 20:59:15,305 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:59:15,305 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:59:15,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:59:15 BasicIcfg [2025-04-13 20:59:15,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:59:15,308 INFO L158 Benchmark]: Toolchain (without parser) took 859454.29ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 108.0MB in the beginning and 667.6MB in the end (delta: -559.6MB). Peak memory consumption was 903.7MB. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.60ms. Allocated memory is still 155.2MB. Free memory was 108.0MB in the beginning and 93.4MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: RCFGBuilder took 441.45ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 46.6MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 20:59:15,308 INFO L158 Benchmark]: TraceAbstraction took 858690.34ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 45.9MB in the beginning and 667.6MB in the end (delta: -621.6MB). Peak memory consumption was 844.9MB. Max. memory is 8.0GB. [2025-04-13 20:59:15,309 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.19ms. Allocated memory is still 167.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.60ms. Allocated memory is still 155.2MB. Free memory was 108.0MB in the beginning and 93.4MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 441.45ms. Allocated memory is still 155.2MB. Free memory was 89.2MB in the beginning and 46.6MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 858690.34ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 45.9MB in the beginning and 667.6MB in the end (delta: -621.6MB). Peak memory consumption was 844.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 35 locations, 41 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 858.6s, OverallIterations: 51, TraceHistogramMax: 2, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 92.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4226 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4226 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25289 IncrementalHoareTripleChecker+Invalid, 25519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 0 mSDtfsCounter, 25289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2644 GetRequests, 1479 SyntacticMatches, 90 SemanticMatches, 1075 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8112 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24101occurred in iteration=50, InterpolantAutomatonStates: 705, 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.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2037 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 2930 ConstructedInterpolants, 51 QuantifiedInterpolants, 19622 SizeOfPredicates, 213 NumberOfNonLiveVariables, 8233 ConjunctsInSsa, 620 ConjunctsInUnsatCore, 142 InterpolantComputations, 10 PerfectInterpolantSequences, 311/600 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