/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/chl-chromosome-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:59:13,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:59:13,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:59:13,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:59:13,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:59:13,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:59:13,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:59:13,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:59:13,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:59:13,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:59:13,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:59:13,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:59:13,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:59:13,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:59:13,846 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:59:13,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:59:13,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:59:13,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:13,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:13,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:13,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:59:13,848 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:59:14,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:59:14,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:59:14,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:59:14,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:59:14,093 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:59:14,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2025-04-13 19:59:15,398 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67a0aea0/c9c11d13bfc2456a9d106d8e03b2718b/FLAG4548642ef [2025-04-13 19:59:15,611 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:59:15,612 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2025-04-13 19:59:15,619 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67a0aea0/c9c11d13bfc2456a9d106d8e03b2718b/FLAG4548642ef [2025-04-13 19:59:16,398 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67a0aea0/c9c11d13bfc2456a9d106d8e03b2718b [2025-04-13 19:59:16,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:59:16,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:59:16,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:16,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:59:16,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:59:16,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7654e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16, skipping insertion in model container [2025-04-13 19:59:16,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:59:16,583 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/chl-chromosome-trans.wvr.c[3073,3086] [2025-04-13 19:59:16,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:16,606 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:59:16,636 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/chl-chromosome-trans.wvr.c[3073,3086] [2025-04-13 19:59:16,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:59:16,651 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:59:16,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16 WrapperNode [2025-04-13 19:59:16,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:59:16,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:16,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:59:16,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:59:16,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,684 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 249 [2025-04-13 19:59:16,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:59:16,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:59:16,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:59:16,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:59:16,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,705 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 19:59:16,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:59:16,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:59:16,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:59:16,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:59:16,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (1/1) ... [2025-04-13 19:59:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:59:16,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:16,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:59:16,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:59:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:59:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:59:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:59:16,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:59:16,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:59:16,760 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:59:16,837 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:59:16,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:59:17,107 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:59:17,108 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:59:17,108 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:59:17,398 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:59:17,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:17 BoogieIcfgContainer [2025-04-13 19:59:17,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:59:17,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:59:17,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:59:17,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:59:17,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:59:16" (1/3) ... [2025-04-13 19:59:17,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f3317a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:17, skipping insertion in model container [2025-04-13 19:59:17,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:59:16" (2/3) ... [2025-04-13 19:59:17,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f3317a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:59:17, skipping insertion in model container [2025-04-13 19:59:17,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:59:17" (3/3) ... [2025-04-13 19:59:17,404 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-04-13 19:59:17,415 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:59:17,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:59:17,417 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:59:17,468 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:59:17,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:59:17,517 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 19:59:17,519 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:17,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:59:17,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:59:17,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 19:59:17,530 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:59:17,537 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;@219a02f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:59:17,537 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:59:17,549 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:59:17,549 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 19:59:17,549 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:59:17,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:17,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] [2025-04-13 19:59:17,550 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 19:59:17,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -772285425, now seen corresponding path program 1 times [2025-04-13 19:59:17,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:17,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418796555] [2025-04-13 19:59:17,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:17,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:59:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:59:17,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:17,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:59:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:17,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418796555] [2025-04-13 19:59:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418796555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:59:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228703725] [2025-04-13 19:59:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:17,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:59:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:17,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:59:17,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:59:17,951 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:17,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:17,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:17,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:17,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:18,092 INFO L116 PetriNetUnfolderBase]: 202/301 cut-off events. [2025-04-13 19:59:18,092 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:59:18,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 301 events. 202/301 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 693 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2025-04-13 19:59:18,097 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2025-04-13 19:59:18,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 134 flow [2025-04-13 19:59:18,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:59:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:59:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:59:18,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-13 19:59:18,109 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:59:18,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 134 flow [2025-04-13 19:59:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:59:18,116 INFO L231 Difference]: Finished difference. Result has 27 places, 29 transitions, 90 flow [2025-04-13 19:59:18,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=27, PETRI_TRANSITIONS=29} [2025-04-13 19:59:18,120 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 19:59:18,120 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 29 transitions, 90 flow [2025-04-13 19:59:18,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:18,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:18,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:18,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:59:18,121 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 19:59:18,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1009575414, now seen corresponding path program 1 times [2025-04-13 19:59:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:18,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853765851] [2025-04-13 19:59:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:59:18,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:59:18,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:59:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:18,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853765851] [2025-04-13 19:59:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853765851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:18,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:18,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:59:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885239233] [2025-04-13 19:59:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:18,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:59:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:18,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:59:18,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:59:18,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:18,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 19:59:18,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:18,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:18,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:18,500 INFO L116 PetriNetUnfolderBase]: 306/450 cut-off events. [2025-04-13 19:59:18,500 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 19:59:18,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 450 events. 306/450 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1207 event pairs, 124 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 899. Up to 302 conditions per place. [2025-04-13 19:59:18,502 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 37 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2025-04-13 19:59:18,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 199 flow [2025-04-13 19:59:18,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:59:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:59:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 19:59:18,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-13 19:59:18,503 INFO L175 Difference]: Start difference. First operand has 27 places, 29 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-04-13 19:59:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 199 flow [2025-04-13 19:59:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:18,504 INFO L231 Difference]: Finished difference. Result has 29 places, 30 transitions, 96 flow [2025-04-13 19:59:18,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=29, PETRI_TRANSITIONS=30} [2025-04-13 19:59:18,505 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-04-13 19:59:18,505 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 96 flow [2025-04-13 19:59:18,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 19:59:18,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:18,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:18,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:59:18,505 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 19:59:18,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1253278759, now seen corresponding path program 1 times [2025-04-13 19:59:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:18,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188471674] [2025-04-13 19:59:18,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:18,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:59:18,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:59:18,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:18,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:59:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:18,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188471674] [2025-04-13 19:59:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188471674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:18,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912630852] [2025-04-13 19:59:18,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:18,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:18,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:59:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:59:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:59:18,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:18,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:18,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 19:59:18,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:59:18,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:59:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912630852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:18,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 19:59:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314549140] [2025-04-13 19:59:18,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:18,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:59:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:18,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:59:18,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:59:18,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:18,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:18,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:18,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:18,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:18,920 INFO L116 PetriNetUnfolderBase]: 306/459 cut-off events. [2025-04-13 19:59:18,921 INFO L117 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-04-13 19:59:18,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 459 events. 306/459 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1187 event pairs, 202 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 982. Up to 448 conditions per place. [2025-04-13 19:59:18,925 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 24 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2025-04-13 19:59:18,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 210 flow [2025-04-13 19:59:18,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-04-13 19:59:18,926 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-13 19:59:18,926 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 96 flow. Second operand 6 states and 65 transitions. [2025-04-13 19:59:18,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 210 flow [2025-04-13 19:59:18,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:18,930 INFO L231 Difference]: Finished difference. Result has 36 places, 39 transitions, 190 flow [2025-04-13 19:59:18,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=36, PETRI_TRANSITIONS=39} [2025-04-13 19:59:18,930 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-13 19:59:18,930 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 39 transitions, 190 flow [2025-04-13 19:59:18,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:18,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:18,930 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:18,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:59:19,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:19,131 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 19:59:19,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash -371616580, now seen corresponding path program 2 times [2025-04-13 19:59:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:19,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402756893] [2025-04-13 19:59:19,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:19,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:59:19,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 19:59:19,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:59:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 19:59:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:19,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402756893] [2025-04-13 19:59:19,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402756893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:19,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:19,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034859643] [2025-04-13 19:59:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:19,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:59:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:19,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:59:19,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:59:19,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:19,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:19,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:19,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:19,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:19,489 INFO L116 PetriNetUnfolderBase]: 502/754 cut-off events. [2025-04-13 19:59:19,489 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 19:59:19,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 754 events. 502/754 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2549 event pairs, 202 based on Foata normal form. 17/623 useless extension candidates. Maximal degree in co-relation 1613. Up to 460 conditions per place. [2025-04-13 19:59:19,492 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 63 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2025-04-13 19:59:19,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 68 transitions, 405 flow [2025-04-13 19:59:19,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:59:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:59:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-13 19:59:19,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-04-13 19:59:19,496 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 190 flow. Second operand 4 states and 66 transitions. [2025-04-13 19:59:19,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 68 transitions, 405 flow [2025-04-13 19:59:19,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 381 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:19,498 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 186 flow [2025-04-13 19:59:19,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-04-13 19:59:19,498 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 19:59:19,499 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 186 flow [2025-04-13 19:59:19,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:19,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:19,499 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:19,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:59:19,499 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 19:59:19,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash -896417960, now seen corresponding path program 3 times [2025-04-13 19:59:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:19,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630094165] [2025-04-13 19:59:19,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:19,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-04-13 19:59:19,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 19:59:19,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:59:19,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 19:59:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:19,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630094165] [2025-04-13 19:59:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630094165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029069690] [2025-04-13 19:59:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:19,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:59:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:19,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:59:19,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:59:19,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:19,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:19,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:19,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:19,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:19,836 INFO L116 PetriNetUnfolderBase]: 560/836 cut-off events. [2025-04-13 19:59:19,836 INFO L117 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-04-13 19:59:19,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 836 events. 560/836 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2942 event pairs, 97 based on Foata normal form. 24/738 useless extension candidates. Maximal degree in co-relation 2158. Up to 567 conditions per place. [2025-04-13 19:59:19,840 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-04-13 19:59:19,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 392 flow [2025-04-13 19:59:19,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:59:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:59:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-13 19:59:19,841 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-04-13 19:59:19,841 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 186 flow. Second operand 4 states and 58 transitions. [2025-04-13 19:59:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 392 flow [2025-04-13 19:59:19,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 381 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:19,844 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 211 flow [2025-04-13 19:59:19,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-04-13 19:59:19,844 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-04-13 19:59:19,844 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 211 flow [2025-04-13 19:59:19,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:19,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:19,845 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:19,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:59:19,845 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 19:59:19,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1349558386, now seen corresponding path program 4 times [2025-04-13 19:59:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:19,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540406479] [2025-04-13 19:59:19,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:19,859 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:59:19,872 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:59:19,872 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:19,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 19:59:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:20,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540406479] [2025-04-13 19:59:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540406479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:20,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711378448] [2025-04-13 19:59:20,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:20,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:20,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:59:20,117 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:59:20,151 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:59:20,151 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:20,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:20,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:59:20,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 19:59:20,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 19:59:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711378448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:20,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 19:59:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884585693] [2025-04-13 19:59:20,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:20,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:59:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:20,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:59:20,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:59:20,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:20,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 211 flow. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 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 19:59:20,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:20,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:20,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:20,449 INFO L116 PetriNetUnfolderBase]: 560/839 cut-off events. [2025-04-13 19:59:20,449 INFO L117 PetriNetUnfolderBase]: For 911/911 co-relation queries the response was YES. [2025-04-13 19:59:20,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 839 events. 560/839 cut-off events. For 911/911 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2703 event pairs, 371 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 2275. Up to 825 conditions per place. [2025-04-13 19:59:20,452 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 28 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2025-04-13 19:59:20,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 321 flow [2025-04-13 19:59:20,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:59:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:59:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 19:59:20,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-13 19:59:20,454 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 211 flow. Second operand 7 states and 65 transitions. [2025-04-13 19:59:20,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 321 flow [2025-04-13 19:59:20,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:20,456 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 276 flow [2025-04-13 19:59:20,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-13 19:59:20,456 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-13 19:59:20,456 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 276 flow [2025-04-13 19:59:20,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 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 19:59:20,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:20,457 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:20,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:59:20,657 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 19:59:20,657 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 19:59:20,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1763978331, now seen corresponding path program 5 times [2025-04-13 19:59:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:20,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406489723] [2025-04-13 19:59:20,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:20,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-04-13 19:59:20,704 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:59:20,705 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:20,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406489723] [2025-04-13 19:59:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406489723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:59:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205825189] [2025-04-13 19:59:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:20,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:59:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:20,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:59:20,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:59:20,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:20,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:20,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:20,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:20,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:21,009 INFO L116 PetriNetUnfolderBase]: 477/714 cut-off events. [2025-04-13 19:59:21,010 INFO L117 PetriNetUnfolderBase]: For 572/572 co-relation queries the response was YES. [2025-04-13 19:59:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 714 events. 477/714 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2305 event pairs, 178 based on Foata normal form. 24/635 useless extension candidates. Maximal degree in co-relation 1934. Up to 487 conditions per place. [2025-04-13 19:59:21,016 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 61 selfloop transitions, 6 changer transitions 2/69 dead transitions. [2025-04-13 19:59:21,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 482 flow [2025-04-13 19:59:21,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:59:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:59:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-13 19:59:21,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-13 19:59:21,017 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 276 flow. Second operand 4 states and 62 transitions. [2025-04-13 19:59:21,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 482 flow [2025-04-13 19:59:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 446 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 19:59:21,019 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 261 flow [2025-04-13 19:59:21,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-04-13 19:59:21,019 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-13 19:59:21,019 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 261 flow [2025-04-13 19:59:21,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:21,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:21,022 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:21,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:59:21,023 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 19:59:21,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1303862874, now seen corresponding path program 1 times [2025-04-13 19:59:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:21,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630779742] [2025-04-13 19:59:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:59:21,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:21,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630779742] [2025-04-13 19:59:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630779742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106633997] [2025-04-13 19:59:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:21,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:21,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:21,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:21,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:21,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:21,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:21,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:21,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:21,533 INFO L116 PetriNetUnfolderBase]: 790/1171 cut-off events. [2025-04-13 19:59:21,533 INFO L117 PetriNetUnfolderBase]: For 1740/1740 co-relation queries the response was YES. [2025-04-13 19:59:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1171 events. 790/1171 cut-off events. For 1740/1740 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4384 event pairs, 255 based on Foata normal form. 12/987 useless extension candidates. Maximal degree in co-relation 3414. Up to 684 conditions per place. [2025-04-13 19:59:21,537 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 71 selfloop transitions, 4 changer transitions 13/88 dead transitions. [2025-04-13 19:59:21,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 614 flow [2025-04-13 19:59:21,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-13 19:59:21,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:59:21,538 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 261 flow. Second operand 5 states and 75 transitions. [2025-04-13 19:59:21,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 614 flow [2025-04-13 19:59:21,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 574 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 19:59:21,541 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 270 flow [2025-04-13 19:59:21,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-04-13 19:59:21,541 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-04-13 19:59:21,541 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 270 flow [2025-04-13 19:59:21,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:21,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:21,541 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:21,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:59:21,541 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 19:59:21,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash -853370930, now seen corresponding path program 2 times [2025-04-13 19:59:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:21,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496521625] [2025-04-13 19:59:21,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:21,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:21,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:21,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:21,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:21,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496521625] [2025-04-13 19:59:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496521625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:21,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299980276] [2025-04-13 19:59:21,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:21,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:21,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:59:21,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:21,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:21,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:21,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:21,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:21,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:21,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299980276] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-04-13 19:59:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391650753] [2025-04-13 19:59:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:21,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:21,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:59:21,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:21,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:21,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:21,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:21,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:22,204 INFO L116 PetriNetUnfolderBase]: 810/1188 cut-off events. [2025-04-13 19:59:22,205 INFO L117 PetriNetUnfolderBase]: For 1771/1771 co-relation queries the response was YES. [2025-04-13 19:59:22,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1188 events. 810/1188 cut-off events. For 1771/1771 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4238 event pairs, 119 based on Foata normal form. 22/1079 useless extension candidates. Maximal degree in co-relation 3743. Up to 458 conditions per place. [2025-04-13 19:59:22,210 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 83 selfloop transitions, 7 changer transitions 3/93 dead transitions. [2025-04-13 19:59:22,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 671 flow [2025-04-13 19:59:22,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-13 19:59:22,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-13 19:59:22,211 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 270 flow. Second operand 5 states and 71 transitions. [2025-04-13 19:59:22,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 671 flow [2025-04-13 19:59:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 651 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:22,214 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 313 flow [2025-04-13 19:59:22,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-04-13 19:59:22,214 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2025-04-13 19:59:22,214 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 313 flow [2025-04-13 19:59:22,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:22,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:22,214 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:22,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:59:22,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:22,415 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 19:59:22,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1652307296, now seen corresponding path program 3 times [2025-04-13 19:59:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:22,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580901450] [2025-04-13 19:59:22,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:22,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:22,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 19:59:22,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:59:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:22,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580901450] [2025-04-13 19:59:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580901450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628088962] [2025-04-13 19:59:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:22,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:22,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:22,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:22,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:22,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:22,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:22,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:22,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:22,911 INFO L116 PetriNetUnfolderBase]: 1006/1479 cut-off events. [2025-04-13 19:59:22,911 INFO L117 PetriNetUnfolderBase]: For 2674/2674 co-relation queries the response was YES. [2025-04-13 19:59:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 1479 events. 1006/1479 cut-off events. For 2674/2674 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5698 event pairs, 273 based on Foata normal form. 24/1356 useless extension candidates. Maximal degree in co-relation 4779. Up to 750 conditions per place. [2025-04-13 19:59:22,919 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 82 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2025-04-13 19:59:22,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 661 flow [2025-04-13 19:59:22,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-13 19:59:22,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:59:22,920 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 313 flow. Second operand 5 states and 75 transitions. [2025-04-13 19:59:22,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 661 flow [2025-04-13 19:59:22,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:22,927 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 363 flow [2025-04-13 19:59:22,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-04-13 19:59:22,928 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2025-04-13 19:59:22,928 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 363 flow [2025-04-13 19:59:22,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:22,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:22,928 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:22,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:59:22,928 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 19:59:22,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1103861584, now seen corresponding path program 4 times [2025-04-13 19:59:22,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:22,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401227921] [2025-04-13 19:59:22,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:22,949 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:22,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:22,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:22,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:23,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401227921] [2025-04-13 19:59:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401227921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239727642] [2025-04-13 19:59:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:23,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:23,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:23,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:23,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:23,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:23,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:23,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:23,418 INFO L116 PetriNetUnfolderBase]: 994/1467 cut-off events. [2025-04-13 19:59:23,418 INFO L117 PetriNetUnfolderBase]: For 3941/3941 co-relation queries the response was YES. [2025-04-13 19:59:23,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 1467 events. 994/1467 cut-off events. For 3941/3941 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5628 event pairs, 334 based on Foata normal form. 12/1332 useless extension candidates. Maximal degree in co-relation 5340. Up to 970 conditions per place. [2025-04-13 19:59:23,425 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 72 selfloop transitions, 7 changer transitions 15/94 dead transitions. [2025-04-13 19:59:23,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 753 flow [2025-04-13 19:59:23,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-13 19:59:23,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-13 19:59:23,427 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 363 flow. Second operand 5 states and 71 transitions. [2025-04-13 19:59:23,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 753 flow [2025-04-13 19:59:23,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 734 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:23,433 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 423 flow [2025-04-13 19:59:23,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-04-13 19:59:23,435 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-13 19:59:23,435 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 423 flow [2025-04-13 19:59:23,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:23,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:23,435 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:23,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:59:23,435 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 19:59:23,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 701945918, now seen corresponding path program 5 times [2025-04-13 19:59:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:23,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825060182] [2025-04-13 19:59:23,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:23,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:23,473 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:23,473 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:23,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:23,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:23,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825060182] [2025-04-13 19:59:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825060182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:23,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326937022] [2025-04-13 19:59:23,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:23,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:23,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:23,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:59:23,732 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:23,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:23,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:23,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:23,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:23,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:24,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326937022] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 19:59:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982209459] [2025-04-13 19:59:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:24,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:24,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:24,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:59:24,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:24,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:24,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:24,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:24,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:24,413 INFO L116 PetriNetUnfolderBase]: 906/1328 cut-off events. [2025-04-13 19:59:24,413 INFO L117 PetriNetUnfolderBase]: For 3976/3976 co-relation queries the response was YES. [2025-04-13 19:59:24,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 1328 events. 906/1328 cut-off events. For 3976/3976 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4914 event pairs, 247 based on Foata normal form. 22/1211 useless extension candidates. Maximal degree in co-relation 4936. Up to 750 conditions per place. [2025-04-13 19:59:24,419 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 77 selfloop transitions, 13 changer transitions 4/94 dead transitions. [2025-04-13 19:59:24,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 758 flow [2025-04-13 19:59:24,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-13 19:59:24,420 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-04-13 19:59:24,421 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 423 flow. Second operand 5 states and 76 transitions. [2025-04-13 19:59:24,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 758 flow [2025-04-13 19:59:24,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 94 transitions, 734 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:24,427 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 439 flow [2025-04-13 19:59:24,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=439, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2025-04-13 19:59:24,428 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-04-13 19:59:24,428 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 439 flow [2025-04-13 19:59:24,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:24,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:24,428 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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 19:59:24,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:59:24,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:24,629 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 19:59:24,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 628404998, now seen corresponding path program 6 times [2025-04-13 19:59:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:24,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391006757] [2025-04-13 19:59:24,629 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:24,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:24,678 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 19:59:24,678 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:24,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:24,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391006757] [2025-04-13 19:59:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391006757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:24,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831182132] [2025-04-13 19:59:24,803 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:24,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:24,805 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:24,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:59:24,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:24,922 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 19:59:24,923 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:24,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:24,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:24,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:24,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831182132] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:25,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 19:59:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049509394] [2025-04-13 19:59:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:25,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:25,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:25,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:59:25,038 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:25,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:25,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:25,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:25,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:25,253 INFO L116 PetriNetUnfolderBase]: 860/1253 cut-off events. [2025-04-13 19:59:25,253 INFO L117 PetriNetUnfolderBase]: For 4100/4100 co-relation queries the response was YES. [2025-04-13 19:59:25,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 1253 events. 860/1253 cut-off events. For 4100/4100 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4460 event pairs, 107 based on Foata normal form. 22/1140 useless extension candidates. Maximal degree in co-relation 4688. Up to 707 conditions per place. [2025-04-13 19:59:25,258 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 77 selfloop transitions, 14 changer transitions 1/92 dead transitions. [2025-04-13 19:59:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 771 flow [2025-04-13 19:59:25,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-13 19:59:25,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-04-13 19:59:25,259 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 439 flow. Second operand 5 states and 67 transitions. [2025-04-13 19:59:25,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 771 flow [2025-04-13 19:59:25,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 737 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 19:59:25,265 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 461 flow [2025-04-13 19:59:25,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-04-13 19:59:25,266 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-13 19:59:25,266 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 461 flow [2025-04-13 19:59:25,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:25,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:25,267 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:25,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:59:25,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 19:59:25,467 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 19:59:25,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1727742692, now seen corresponding path program 1 times [2025-04-13 19:59:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:25,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88961540] [2025-04-13 19:59:25,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:25,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:25,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:25,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:25,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:26,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:26,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88961540] [2025-04-13 19:59:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88961540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:26,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689429460] [2025-04-13 19:59:26,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:26,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:26,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:26,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:26,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:59:26,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:26,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:26,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:26,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:26,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 19:59:26,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:26,622 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:26,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 19:59:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:26,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:27,015 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:27,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689429460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:27,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 29 [2025-04-13 19:59:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74057598] [2025-04-13 19:59:27,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:27,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 19:59:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:27,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 19:59:27,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-04-13 19:59:27,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:27,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 461 flow. Second operand has 30 states, 30 states have (on average 5.233333333333333) internal successors, (157), 30 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:27,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:27,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:27,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:28,761 INFO L116 PetriNetUnfolderBase]: 1968/2862 cut-off events. [2025-04-13 19:59:28,761 INFO L117 PetriNetUnfolderBase]: For 7612/7612 co-relation queries the response was YES. [2025-04-13 19:59:28,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10563 conditions, 2862 events. 1968/2862 cut-off events. For 7612/7612 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12808 event pairs, 153 based on Foata normal form. 1/2442 useless extension candidates. Maximal degree in co-relation 10452. Up to 929 conditions per place. [2025-04-13 19:59:28,778 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 154 selfloop transitions, 82 changer transitions 14/250 dead transitions. [2025-04-13 19:59:28,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 250 transitions, 2034 flow [2025-04-13 19:59:28,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:59:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:59:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 232 transitions. [2025-04-13 19:59:28,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-04-13 19:59:28,784 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 461 flow. Second operand 20 states and 232 transitions. [2025-04-13 19:59:28,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 250 transitions, 2034 flow [2025-04-13 19:59:28,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 250 transitions, 1944 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 19:59:28,812 INFO L231 Difference]: Finished difference. Result has 90 places, 143 transitions, 1330 flow [2025-04-13 19:59:28,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1330, PETRI_PLACES=90, PETRI_TRANSITIONS=143} [2025-04-13 19:59:28,813 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2025-04-13 19:59:28,813 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 143 transitions, 1330 flow [2025-04-13 19:59:28,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.233333333333333) internal successors, (157), 30 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:28,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:28,814 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:28,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:59:29,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:29,014 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 19:59:29,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -485922268, now seen corresponding path program 2 times [2025-04-13 19:59:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:29,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528844510] [2025-04-13 19:59:29,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:29,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:59:29,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:29,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:29,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 19:59:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:30,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528844510] [2025-04-13 19:59:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528844510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:30,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281217202] [2025-04-13 19:59:30,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:30,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:30,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:59:30,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:59:30,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:30,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:30,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:30,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 19:59:30,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:30,615 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:30,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 19:59:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:30,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:30,978 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:30,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281217202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:31,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 8] total 33 [2025-04-13 19:59:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644010482] [2025-04-13 19:59:31,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:31,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 19:59:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:31,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 19:59:31,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 19:59:31,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:31,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 143 transitions, 1330 flow. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:31,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:31,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:32,537 INFO L116 PetriNetUnfolderBase]: 2252/3272 cut-off events. [2025-04-13 19:59:32,537 INFO L117 PetriNetUnfolderBase]: For 12858/12858 co-relation queries the response was YES. [2025-04-13 19:59:32,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14672 conditions, 3272 events. 2252/3272 cut-off events. For 12858/12858 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 14983 event pairs, 215 based on Foata normal form. 1/3235 useless extension candidates. Maximal degree in co-relation 14554. Up to 1025 conditions per place. [2025-04-13 19:59:32,551 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 144 selfloop transitions, 105 changer transitions 53/302 dead transitions. [2025-04-13 19:59:32,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 302 transitions, 2903 flow [2025-04-13 19:59:32,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:59:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:59:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 258 transitions. [2025-04-13 19:59:32,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-04-13 19:59:32,552 INFO L175 Difference]: Start difference. First operand has 90 places, 143 transitions, 1330 flow. Second operand 24 states and 258 transitions. [2025-04-13 19:59:32,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 302 transitions, 2903 flow [2025-04-13 19:59:32,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 302 transitions, 2838 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:32,580 INFO L231 Difference]: Finished difference. Result has 119 places, 164 transitions, 1758 flow [2025-04-13 19:59:32,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1758, PETRI_PLACES=119, PETRI_TRANSITIONS=164} [2025-04-13 19:59:32,580 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-04-13 19:59:32,580 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 164 transitions, 1758 flow [2025-04-13 19:59:32,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:32,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:32,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:32,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:59:32,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:32,785 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 19:59:32,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1081679346, now seen corresponding path program 3 times [2025-04-13 19:59:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:32,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444830196] [2025-04-13 19:59:32,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:32,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:32,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 19:59:32,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:59:32,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:33,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444830196] [2025-04-13 19:59:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444830196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:33,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201874863] [2025-04-13 19:59:33,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:33,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:33,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:59:33,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:33,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 19:59:33,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:59:33,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:33,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 19:59:33,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:33,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:33,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 19:59:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:33,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:34,035 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:34,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201874863] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:34,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-13 19:59:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586881046] [2025-04-13 19:59:34,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:34,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 19:59:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:34,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 19:59:34,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-13 19:59:34,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:34,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 164 transitions, 1758 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:34,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:34,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:34,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:35,147 INFO L116 PetriNetUnfolderBase]: 1990/2890 cut-off events. [2025-04-13 19:59:35,147 INFO L117 PetriNetUnfolderBase]: For 21368/21368 co-relation queries the response was YES. [2025-04-13 19:59:35,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16786 conditions, 2890 events. 1990/2890 cut-off events. For 21368/21368 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12832 event pairs, 276 based on Foata normal form. 1/2891 useless extension candidates. Maximal degree in co-relation 16650. Up to 1056 conditions per place. [2025-04-13 19:59:35,162 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 154 selfloop transitions, 88 changer transitions 3/245 dead transitions. [2025-04-13 19:59:35,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 245 transitions, 2785 flow [2025-04-13 19:59:35,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:59:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:59:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2025-04-13 19:59:35,164 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-04-13 19:59:35,164 INFO L175 Difference]: Start difference. First operand has 119 places, 164 transitions, 1758 flow. Second operand 16 states and 176 transitions. [2025-04-13 19:59:35,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 245 transitions, 2785 flow [2025-04-13 19:59:35,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 245 transitions, 2624 flow, removed 29 selfloop flow, removed 13 redundant places. [2025-04-13 19:59:35,204 INFO L231 Difference]: Finished difference. Result has 119 places, 167 transitions, 1812 flow [2025-04-13 19:59:35,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1812, PETRI_PLACES=119, PETRI_TRANSITIONS=167} [2025-04-13 19:59:35,206 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-04-13 19:59:35,206 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 167 transitions, 1812 flow [2025-04-13 19:59:35,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:35,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:35,207 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:35,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 19:59:35,411 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,SelfDestructingSolverStorable15 [2025-04-13 19:59:35,411 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 19:59:35,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1491390456, now seen corresponding path program 4 times [2025-04-13 19:59:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:35,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464697854] [2025-04-13 19:59:35,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:35,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:59:35,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:35,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:35,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:36,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464697854] [2025-04-13 19:59:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464697854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:36,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017561499] [2025-04-13 19:59:36,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:36,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:36,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 19:59:36,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 19:59:36,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:36,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:36,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 19:59:36,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:36,327 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:36,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 19:59:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:36,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:40,694 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:40,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017561499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:40,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2025-04-13 19:59:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665950220] [2025-04-13 19:59:40,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:40,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 19:59:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:40,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 19:59:40,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=651, Unknown=1, NotChecked=0, Total=756 [2025-04-13 19:59:40,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:40,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 167 transitions, 1812 flow. Second operand has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:40,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:40,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:40,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:42,357 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 19:59:43,716 INFO L116 PetriNetUnfolderBase]: 2004/2916 cut-off events. [2025-04-13 19:59:43,716 INFO L117 PetriNetUnfolderBase]: For 23586/23586 co-relation queries the response was YES. [2025-04-13 19:59:43,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17500 conditions, 2916 events. 2004/2916 cut-off events. For 23586/23586 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12990 event pairs, 272 based on Foata normal form. 1/2906 useless extension candidates. Maximal degree in co-relation 17379. Up to 1031 conditions per place. [2025-04-13 19:59:43,732 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 156 selfloop transitions, 98 changer transitions 3/257 dead transitions. [2025-04-13 19:59:43,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 257 transitions, 2910 flow [2025-04-13 19:59:43,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 19:59:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 19:59:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 206 transitions. [2025-04-13 19:59:43,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36140350877192984 [2025-04-13 19:59:43,733 INFO L175 Difference]: Start difference. First operand has 119 places, 167 transitions, 1812 flow. Second operand 19 states and 206 transitions. [2025-04-13 19:59:43,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 257 transitions, 2910 flow [2025-04-13 19:59:43,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 257 transitions, 2767 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-04-13 19:59:43,780 INFO L231 Difference]: Finished difference. Result has 126 places, 169 transitions, 1896 flow [2025-04-13 19:59:43,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1896, PETRI_PLACES=126, PETRI_TRANSITIONS=169} [2025-04-13 19:59:43,781 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-04-13 19:59:43,781 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 169 transitions, 1896 flow [2025-04-13 19:59:43,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:43,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:43,781 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:43,788 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 19:59:43,982 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,SelfDestructingSolverStorable16 [2025-04-13 19:59:43,982 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 19:59:43,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1100170974, now seen corresponding path program 5 times [2025-04-13 19:59:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:43,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493722670] [2025-04-13 19:59:43,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:43,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:44,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:44,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:44,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-13 19:59:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:44,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493722670] [2025-04-13 19:59:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493722670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:44,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276417225] [2025-04-13 19:59:44,711 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:44,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:44,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:44,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 19:59:44,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:45,173 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:45,174 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:45,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:45,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 19:59:45,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:45,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:45,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 48 [2025-04-13 19:59:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:45,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:45,789 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-13 19:59:45,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 212 [2025-04-13 19:59:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276417225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:51,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:51,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 8] total 26 [2025-04-13 19:59:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839208310] [2025-04-13 19:59:51,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:51,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 19:59:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:51,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 19:59:51,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:59:51,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:51,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 169 transitions, 1896 flow. Second operand has 27 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:51,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:51,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:51,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:53,471 INFO L116 PetriNetUnfolderBase]: 2961/4261 cut-off events. [2025-04-13 19:59:53,471 INFO L117 PetriNetUnfolderBase]: For 37322/37322 co-relation queries the response was YES. [2025-04-13 19:59:53,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26104 conditions, 4261 events. 2961/4261 cut-off events. For 37322/37322 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20095 event pairs, 340 based on Foata normal form. 1/4262 useless extension candidates. Maximal degree in co-relation 25982. Up to 2460 conditions per place. [2025-04-13 19:59:53,490 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 182 selfloop transitions, 144 changer transitions 32/358 dead transitions. [2025-04-13 19:59:53,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 358 transitions, 4321 flow [2025-04-13 19:59:53,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:59:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:59:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2025-04-13 19:59:53,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2025-04-13 19:59:53,492 INFO L175 Difference]: Start difference. First operand has 126 places, 169 transitions, 1896 flow. Second operand 24 states and 256 transitions. [2025-04-13 19:59:53,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 358 transitions, 4321 flow [2025-04-13 19:59:53,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 358 transitions, 4122 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-04-13 19:59:53,595 INFO L231 Difference]: Finished difference. Result has 145 places, 237 transitions, 3072 flow [2025-04-13 19:59:53,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3072, PETRI_PLACES=145, PETRI_TRANSITIONS=237} [2025-04-13 19:59:53,596 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-04-13 19:59:53,596 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 237 transitions, 3072 flow [2025-04-13 19:59:53,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:53,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:53,596 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:53,603 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 19:59:53,796 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,SelfDestructingSolverStorable17 [2025-04-13 19:59:53,797 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 19:59:53,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -185117822, now seen corresponding path program 6 times [2025-04-13 19:59:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:53,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286566208] [2025-04-13 19:59:53,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:53,810 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:53,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 19:59:53,832 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:53,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:54,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286566208] [2025-04-13 19:59:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286566208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:54,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371189435] [2025-04-13 19:59:54,380 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:54,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:54,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:54,382 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:54,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:59:54,484 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 19:59:54,518 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 19:59:54,518 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:54,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 19:59:54,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:54,829 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:54,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 19:59:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:54,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:55,187 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:55,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:55,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371189435] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:55,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:55,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-13 19:59:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893628873] [2025-04-13 19:59:55,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:55,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 19:59:55,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:55,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 19:59:55,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-13 19:59:55,296 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:55,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 237 transitions, 3072 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:55,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:55,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:55,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:56,722 INFO L116 PetriNetUnfolderBase]: 2779/4031 cut-off events. [2025-04-13 19:59:56,722 INFO L117 PetriNetUnfolderBase]: For 72844/72844 co-relation queries the response was YES. [2025-04-13 19:59:56,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29564 conditions, 4031 events. 2779/4031 cut-off events. For 72844/72844 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 19276 event pairs, 427 based on Foata normal form. 1/4032 useless extension candidates. Maximal degree in co-relation 29426. Up to 1818 conditions per place. [2025-04-13 19:59:56,741 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 216 selfloop transitions, 121 changer transitions 1/338 dead transitions. [2025-04-13 19:59:56,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 338 transitions, 4532 flow [2025-04-13 19:59:56,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 19:59:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 19:59:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 222 transitions. [2025-04-13 19:59:56,742 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2025-04-13 19:59:56,742 INFO L175 Difference]: Start difference. First operand has 145 places, 237 transitions, 3072 flow. Second operand 21 states and 222 transitions. [2025-04-13 19:59:56,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 338 transitions, 4532 flow [2025-04-13 19:59:56,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 338 transitions, 4319 flow, removed 71 selfloop flow, removed 7 redundant places. [2025-04-13 19:59:56,890 INFO L231 Difference]: Finished difference. Result has 162 places, 250 transitions, 3364 flow [2025-04-13 19:59:56,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2866, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3364, PETRI_PLACES=162, PETRI_TRANSITIONS=250} [2025-04-13 19:59:56,890 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2025-04-13 19:59:56,890 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 250 transitions, 3364 flow [2025-04-13 19:59:56,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:56,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:56,891 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:56,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:59:57,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:57,091 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 19:59:57,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 86246460, now seen corresponding path program 7 times [2025-04-13 19:59:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:57,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710907015] [2025-04-13 19:59:57,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:59:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:57,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:57,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:57,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:57,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710907015] [2025-04-13 19:59:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710907015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:57,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70772104] [2025-04-13 19:59:57,889 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:59:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:57,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:59:57,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 19:59:58,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:58,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:58,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:58,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 19:59:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:58,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:58,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 19:59:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:58,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:58,542 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 19:59:58,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 19:59:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70772104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:59:58,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:59:58,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 29 [2025-04-13 19:59:58,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055375474] [2025-04-13 19:59:58,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:59:58,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 19:59:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:58,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 19:59:58,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-13 19:59:58,642 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:58,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 250 transitions, 3364 flow. Second operand has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:58,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:58,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:58,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:00,734 INFO L116 PetriNetUnfolderBase]: 3042/4423 cut-off events. [2025-04-13 20:00:00,734 INFO L117 PetriNetUnfolderBase]: For 92606/92606 co-relation queries the response was YES. [2025-04-13 20:00:00,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34226 conditions, 4423 events. 3042/4423 cut-off events. For 92606/92606 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 21490 event pairs, 328 based on Foata normal form. 1/4413 useless extension candidates. Maximal degree in co-relation 34087. Up to 1543 conditions per place. [2025-04-13 20:00:00,760 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 241 selfloop transitions, 157 changer transitions 4/402 dead transitions. [2025-04-13 20:00:00,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 402 transitions, 5528 flow [2025-04-13 20:00:00,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 20:00:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 20:00:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 318 transitions. [2025-04-13 20:00:00,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2025-04-13 20:00:00,762 INFO L175 Difference]: Start difference. First operand has 162 places, 250 transitions, 3364 flow. Second operand 30 states and 318 transitions. [2025-04-13 20:00:00,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 402 transitions, 5528 flow [2025-04-13 20:00:00,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 402 transitions, 5237 flow, removed 60 selfloop flow, removed 13 redundant places. [2025-04-13 20:00:00,917 INFO L231 Difference]: Finished difference. Result has 186 places, 273 transitions, 3825 flow [2025-04-13 20:00:00,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3825, PETRI_PLACES=186, PETRI_TRANSITIONS=273} [2025-04-13 20:00:00,917 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2025-04-13 20:00:00,918 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 273 transitions, 3825 flow [2025-04-13 20:00:00,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:00:00,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:00,918 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:00,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:00:01,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:01,118 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:00:01,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -989944024, now seen corresponding path program 8 times [2025-04-13 20:00:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:01,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835631610] [2025-04-13 20:00:01,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:00:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:01,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:00:01,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:01,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:00:01,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:01,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835631610] [2025-04-13 20:00:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835631610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:00:01,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567865011] [2025-04-13 20:00:01,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:00:01,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:01,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:01,780 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:00:01,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:00:01,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:00:01,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:01,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:00:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:01,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:00:01,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:00:02,152 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:00:02,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:00:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:02,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:02,532 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-13 20:00:02,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-13 20:00:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567865011] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:00:02,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:00:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-13 20:00:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674348906] [2025-04-13 20:00:02,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:00:02,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:00:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:02,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:00:02,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:00:02,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:02,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 273 transitions, 3825 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:00:02,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:02,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:02,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:04,017 INFO L116 PetriNetUnfolderBase]: 3058/4451 cut-off events. [2025-04-13 20:00:04,018 INFO L117 PetriNetUnfolderBase]: For 94450/94450 co-relation queries the response was YES. [2025-04-13 20:00:04,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36491 conditions, 4451 events. 3058/4451 cut-off events. For 94450/94450 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21671 event pairs, 494 based on Foata normal form. 2/4442 useless extension candidates. Maximal degree in co-relation 36346. Up to 2118 conditions per place. [2025-04-13 20:00:04,041 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 234 selfloop transitions, 116 changer transitions 2/352 dead transitions. [2025-04-13 20:00:04,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 352 transitions, 5270 flow [2025-04-13 20:00:04,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:00:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:00:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 184 transitions. [2025-04-13 20:00:04,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3607843137254902 [2025-04-13 20:00:04,042 INFO L175 Difference]: Start difference. First operand has 186 places, 273 transitions, 3825 flow. Second operand 17 states and 184 transitions. [2025-04-13 20:00:04,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 352 transitions, 5270 flow [2025-04-13 20:00:04,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 352 transitions, 4890 flow, removed 54 selfloop flow, removed 21 redundant places. [2025-04-13 20:00:04,261 INFO L231 Difference]: Finished difference. Result has 183 places, 278 transitions, 3798 flow [2025-04-13 20:00:04,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3464, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3798, PETRI_PLACES=183, PETRI_TRANSITIONS=278} [2025-04-13 20:00:04,261 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-04-13 20:00:04,261 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 278 transitions, 3798 flow [2025-04-13 20:00:04,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:00:04,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:04,262 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:04,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:00:04,462 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,SelfDestructingSolverStorable20 [2025-04-13 20:00:04,462 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:00:04,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2050072564, now seen corresponding path program 9 times [2025-04-13 20:00:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:04,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360496532] [2025-04-13 20:00:04,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:00:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:04,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:04,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:00:04,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:00:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:05,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360496532] [2025-04-13 20:00:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360496532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:00:05,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771066267] [2025-04-13 20:00:05,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:00:05,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:05,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:05,144 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:00:05,145 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:00:05,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:05,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 20:00:05,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:00:05,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:05,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:00:05,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:00:05,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:00:05,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:00:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:05,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:05,829 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-13 20:00:05,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-13 20:00:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771066267] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:00:10,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:00:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 27 [2025-04-13 20:00:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862363994] [2025-04-13 20:00:10,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:00:10,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:00:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:10,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:00:10,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:00:10,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:10,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 278 transitions, 3798 flow. Second operand has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:00:10,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:10,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:10,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:11,871 INFO L116 PetriNetUnfolderBase]: 3603/5333 cut-off events. [2025-04-13 20:00:11,872 INFO L117 PetriNetUnfolderBase]: For 115153/115153 co-relation queries the response was YES. [2025-04-13 20:00:11,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43259 conditions, 5333 events. 3603/5333 cut-off events. For 115153/115153 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 27836 event pairs, 648 based on Foata normal form. 3/5325 useless extension candidates. Maximal degree in co-relation 43113. Up to 3814 conditions per place. [2025-04-13 20:00:11,914 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 297 selfloop transitions, 139 changer transitions 4/440 dead transitions. [2025-04-13 20:00:11,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 440 transitions, 6549 flow [2025-04-13 20:00:11,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:00:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:00:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 241 transitions. [2025-04-13 20:00:11,915 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492753623188406 [2025-04-13 20:00:11,915 INFO L175 Difference]: Start difference. First operand has 183 places, 278 transitions, 3798 flow. Second operand 23 states and 241 transitions. [2025-04-13 20:00:11,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 440 transitions, 6549 flow [2025-04-13 20:00:12,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 440 transitions, 6280 flow, removed 26 selfloop flow, removed 13 redundant places. [2025-04-13 20:00:12,219 INFO L231 Difference]: Finished difference. Result has 202 places, 333 transitions, 4816 flow [2025-04-13 20:00:12,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4816, PETRI_PLACES=202, PETRI_TRANSITIONS=333} [2025-04-13 20:00:12,219 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2025-04-13 20:00:12,219 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 333 transitions, 4816 flow [2025-04-13 20:00:12,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:00:12,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:12,220 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:12,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 20:00:12,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:12,420 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:00:12,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1459705824, now seen corresponding path program 10 times [2025-04-13 20:00:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:12,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138005914] [2025-04-13 20:00:12,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:00:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:12,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:00:12,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:12,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:00:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:13,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138005914] [2025-04-13 20:00:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138005914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:00:13,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806800888] [2025-04-13 20:00:13,110 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:00:13,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:13,112 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:00:13,114 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:00:13,228 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:00:13,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:13,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:00:13,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:13,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:00:13,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:00:13,398 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:00:13,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 20:00:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:13,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:14,881 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-13 20:00:14,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-13 20:00:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806800888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:00:20,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:00:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 26 [2025-04-13 20:00:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133074607] [2025-04-13 20:00:20,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:00:20,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:00:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:20,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:00:20,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:00:20,081 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:20,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 333 transitions, 4816 flow. Second operand has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:00:20,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:20,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:20,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:22,449 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:00:24,103 INFO L116 PetriNetUnfolderBase]: 3711/5507 cut-off events. [2025-04-13 20:00:24,103 INFO L117 PetriNetUnfolderBase]: For 137991/137991 co-relation queries the response was YES. [2025-04-13 20:00:24,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47696 conditions, 5507 events. 3711/5507 cut-off events. For 137991/137991 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29112 event pairs, 733 based on Foata normal form. 3/5499 useless extension candidates. Maximal degree in co-relation 47540. Up to 4452 conditions per place. [2025-04-13 20:00:24,141 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 269 selfloop transitions, 127 changer transitions 1/397 dead transitions. [2025-04-13 20:00:24,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 397 transitions, 6305 flow [2025-04-13 20:00:24,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:00:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:00:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2025-04-13 20:00:24,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2025-04-13 20:00:24,142 INFO L175 Difference]: Start difference. First operand has 202 places, 333 transitions, 4816 flow. Second operand 16 states and 158 transitions. [2025-04-13 20:00:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 397 transitions, 6305 flow [2025-04-13 20:00:24,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 397 transitions, 6076 flow, removed 108 selfloop flow, removed 5 redundant places. [2025-04-13 20:00:24,519 INFO L231 Difference]: Finished difference. Result has 214 places, 341 transitions, 5054 flow [2025-04-13 20:00:24,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5054, PETRI_PLACES=214, PETRI_TRANSITIONS=341} [2025-04-13 20:00:24,519 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2025-04-13 20:00:24,519 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 341 transitions, 5054 flow [2025-04-13 20:00:24,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:00:24,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:24,519 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:24,526 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:00:24,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:24,720 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:00:24,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 272801634, now seen corresponding path program 11 times [2025-04-13 20:00:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:24,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337010206] [2025-04-13 20:00:24,721 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:00:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:24,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:24,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:24,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:00:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:00:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:26,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337010206] [2025-04-13 20:00:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337010206] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:00:26,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745467796] [2025-04-13 20:00:26,006 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:00:26,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:26,008 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:00:26,008 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:00:26,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:26,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:00:26,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:00:26,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:26,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 20:00:26,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:00:26,652 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:00:26,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 48 [2025-04-13 20:00:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:26,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:27,060 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-13 20:00:27,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-13 20:00:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745467796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:00:31,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:00:31,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 8] total 39 [2025-04-13 20:00:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105386757] [2025-04-13 20:00:31,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:00:31,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 20:00:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:00:31,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 20:00:31,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 20:00:31,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:00:31,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 341 transitions, 5054 flow. Second operand has 40 states, 40 states have (on average 4.975) internal successors, (199), 40 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:00:31,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:00:31,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:00:31,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:00:35,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:00:37,927 INFO L116 PetriNetUnfolderBase]: 3868/5763 cut-off events. [2025-04-13 20:00:37,927 INFO L117 PetriNetUnfolderBase]: For 144435/144435 co-relation queries the response was YES. [2025-04-13 20:00:37,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49717 conditions, 5763 events. 3868/5763 cut-off events. For 144435/144435 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 30959 event pairs, 708 based on Foata normal form. 6/5758 useless extension candidates. Maximal degree in co-relation 49559. Up to 4567 conditions per place. [2025-04-13 20:00:37,978 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 263 selfloop transitions, 154 changer transitions 1/418 dead transitions. [2025-04-13 20:00:37,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 418 transitions, 6691 flow [2025-04-13 20:00:37,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:00:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:00:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 197 transitions. [2025-04-13 20:00:37,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27361111111111114 [2025-04-13 20:00:37,983 INFO L175 Difference]: Start difference. First operand has 214 places, 341 transitions, 5054 flow. Second operand 24 states and 197 transitions. [2025-04-13 20:00:37,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 418 transitions, 6691 flow [2025-04-13 20:00:38,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 418 transitions, 6497 flow, removed 17 selfloop flow, removed 12 redundant places. [2025-04-13 20:00:38,416 INFO L231 Difference]: Finished difference. Result has 228 places, 358 transitions, 5491 flow [2025-04-13 20:00:38,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4863, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5491, PETRI_PLACES=228, PETRI_TRANSITIONS=358} [2025-04-13 20:00:38,416 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2025-04-13 20:00:38,416 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 358 transitions, 5491 flow [2025-04-13 20:00:38,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.975) internal successors, (199), 40 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:00:38,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:00:38,417 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:00:38,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 20:00:38,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 20:00:38,617 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:00:38,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:00:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2144609060, now seen corresponding path program 12 times [2025-04-13 20:00:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:00:38,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563742383] [2025-04-13 20:00:38,618 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:00:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:00:38,627 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:38,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:00:38,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:00:38,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:00:39,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563742383] [2025-04-13 20:00:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563742383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:00:39,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234592166] [2025-04-13 20:00:39,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:00:39,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:00:39,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:00:39,187 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:00:39,188 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:00:39,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:00:39,325 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:00:39,325 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:00:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:00:39,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:00:39,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:00:39,578 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:00:39,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:00:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:00:39,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:00:40,138 INFO L325 Elim1Store]: treesize reduction 15, result has 95.3 percent of original size [2025-04-13 20:00:40,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 325 [2025-04-13 20:01:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234592166] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:01:19,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:01:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 27 [2025-04-13 20:01:19,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838038477] [2025-04-13 20:01:19,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:01:19,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:01:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:01:19,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:01:19,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:01:19,918 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:01:19,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 358 transitions, 5491 flow. Second operand has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 28 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:01:19,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:01:19,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:01:19,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:01:21,363 INFO L116 PetriNetUnfolderBase]: 4020/6018 cut-off events. [2025-04-13 20:01:21,363 INFO L117 PetriNetUnfolderBase]: For 155949/155949 co-relation queries the response was YES. [2025-04-13 20:01:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52958 conditions, 6018 events. 4020/6018 cut-off events. For 155949/155949 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 32829 event pairs, 807 based on Foata normal form. 6/6013 useless extension candidates. Maximal degree in co-relation 52787. Up to 4891 conditions per place. [2025-04-13 20:01:21,408 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 289 selfloop transitions, 133 changer transitions 2/424 dead transitions. [2025-04-13 20:01:21,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 424 transitions, 7044 flow [2025-04-13 20:01:21,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:01:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:01:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2025-04-13 20:01:21,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:01:21,409 INFO L175 Difference]: Start difference. First operand has 228 places, 358 transitions, 5491 flow. Second operand 16 states and 160 transitions. [2025-04-13 20:01:21,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 424 transitions, 7044 flow [2025-04-13 20:01:21,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 424 transitions, 6848 flow, removed 26 selfloop flow, removed 14 redundant places. [2025-04-13 20:01:21,805 INFO L231 Difference]: Finished difference. Result has 233 places, 373 transitions, 5875 flow [2025-04-13 20:01:21,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5875, PETRI_PLACES=233, PETRI_TRANSITIONS=373} [2025-04-13 20:01:21,806 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2025-04-13 20:01:21,806 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 373 transitions, 5875 flow [2025-04-13 20:01:21,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 28 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:01:21,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:01:21,806 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:01:21,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 20:01:22,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:01:22,007 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:01:22,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:01:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1102191166, now seen corresponding path program 13 times [2025-04-13 20:01:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:01:22,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010645273] [2025-04-13 20:01:22,007 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:01:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:01:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:01:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:01:22,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:01:22,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:01:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:01:22,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010645273] [2025-04-13 20:01:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010645273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:01:22,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226118131] [2025-04-13 20:01:22,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:01:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:01:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:01:22,572 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:01:22,573 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:01:22,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:01:22,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:01:22,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:01:22,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:01:22,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:01:22,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:01:22,890 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:01:22,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 20:01:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:22,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:01:23,321 INFO L325 Elim1Store]: treesize reduction 8, result has 96.5 percent of original size [2025-04-13 20:01:23,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 236 [2025-04-13 20:01:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:34,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226118131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:01:34,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:01:34,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2025-04-13 20:01:34,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006967830] [2025-04-13 20:01:34,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:01:34,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:01:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:01:34,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:01:34,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:01:34,813 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:01:34,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 373 transitions, 5875 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:01:34,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:01:34,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:01:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:01:36,785 INFO L116 PetriNetUnfolderBase]: 4213/6320 cut-off events. [2025-04-13 20:01:36,785 INFO L117 PetriNetUnfolderBase]: For 172757/172757 co-relation queries the response was YES. [2025-04-13 20:01:36,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57193 conditions, 6320 events. 4213/6320 cut-off events. For 172757/172757 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 34843 event pairs, 768 based on Foata normal form. 3/6312 useless extension candidates. Maximal degree in co-relation 57032. Up to 4919 conditions per place. [2025-04-13 20:01:36,833 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 286 selfloop transitions, 187 changer transitions 1/474 dead transitions. [2025-04-13 20:01:36,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 474 transitions, 8083 flow [2025-04-13 20:01:36,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:01:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:01:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 204 transitions. [2025-04-13 20:01:36,834 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-04-13 20:01:36,834 INFO L175 Difference]: Start difference. First operand has 233 places, 373 transitions, 5875 flow. Second operand 20 states and 204 transitions. [2025-04-13 20:01:36,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 474 transitions, 8083 flow [2025-04-13 20:01:37,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 474 transitions, 7851 flow, removed 57 selfloop flow, removed 9 redundant places. [2025-04-13 20:01:37,277 INFO L231 Difference]: Finished difference. Result has 248 places, 407 transitions, 6766 flow [2025-04-13 20:01:37,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5657, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6766, PETRI_PLACES=248, PETRI_TRANSITIONS=407} [2025-04-13 20:01:37,277 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2025-04-13 20:01:37,277 INFO L485 AbstractCegarLoop]: Abstraction has has 248 places, 407 transitions, 6766 flow [2025-04-13 20:01:37,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:01:37,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:01:37,277 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:01:37,284 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:01:37,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:01:37,478 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:01:37,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:01:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1608537432, now seen corresponding path program 14 times [2025-04-13 20:01:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:01:37,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521823031] [2025-04-13 20:01:37,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:01:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:01:37,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:01:37,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:01:37,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:01:37,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:01:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:01:38,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521823031] [2025-04-13 20:01:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521823031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:01:38,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484863919] [2025-04-13 20:01:38,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:01:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:01:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:01:38,135 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:01:38,136 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:01:38,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:01:38,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:01:38,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:01:38,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:01:38,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:01:38,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:01:38,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:01:38,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:01:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:01:38,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:01:38,987 INFO L325 Elim1Store]: treesize reduction 15, result has 95.3 percent of original size [2025-04-13 20:01:38,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 325 [2025-04-13 20:02:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484863919] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:00,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 27 [2025-04-13 20:02:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650819747] [2025-04-13 20:02:00,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:00,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:02:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:00,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:02:00,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:02:00,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:02:00,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 407 transitions, 6766 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:02:00,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:00,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:02:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:03,719 INFO L116 PetriNetUnfolderBase]: 4335/6521 cut-off events. [2025-04-13 20:02:03,719 INFO L117 PetriNetUnfolderBase]: For 185397/185397 co-relation queries the response was YES. [2025-04-13 20:02:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60679 conditions, 6521 events. 4335/6521 cut-off events. For 185397/185397 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36425 event pairs, 822 based on Foata normal form. 3/6513 useless extension candidates. Maximal degree in co-relation 60513. Up to 5277 conditions per place. [2025-04-13 20:02:03,770 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 308 selfloop transitions, 190 changer transitions 1/499 dead transitions. [2025-04-13 20:02:03,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 499 transitions, 8869 flow [2025-04-13 20:02:03,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 20:02:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 20:02:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 204 transitions. [2025-04-13 20:02:03,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2025-04-13 20:02:03,771 INFO L175 Difference]: Start difference. First operand has 248 places, 407 transitions, 6766 flow. Second operand 21 states and 204 transitions. [2025-04-13 20:02:03,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 499 transitions, 8869 flow [2025-04-13 20:02:04,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 499 transitions, 8489 flow, removed 58 selfloop flow, removed 13 redundant places. [2025-04-13 20:02:04,296 INFO L231 Difference]: Finished difference. Result has 260 places, 438 transitions, 7455 flow [2025-04-13 20:02:04,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=6417, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7455, PETRI_PLACES=260, PETRI_TRANSITIONS=438} [2025-04-13 20:02:04,297 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2025-04-13 20:02:04,297 INFO L485 AbstractCegarLoop]: Abstraction has has 260 places, 438 transitions, 7455 flow [2025-04-13 20:02:04,297 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:02:04,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:04,297 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:04,303 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:02:04,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:04,498 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:02:04,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1408071310, now seen corresponding path program 15 times [2025-04-13 20:02:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:04,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693660166] [2025-04-13 20:02:04,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:02:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:04,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:02:04,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 38 statements. [2025-04-13 20:02:04,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:02:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:05,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693660166] [2025-04-13 20:02:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693660166] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:05,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688063189] [2025-04-13 20:02:05,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:02:05,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:05,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:05,034 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:02:05,035 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:02:05,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:02:05,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 38 statements. [2025-04-13 20:02:05,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:02:05,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:02:05,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:05,365 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:05,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:02:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:05,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:05,862 INFO L325 Elim1Store]: treesize reduction 15, result has 95.3 percent of original size [2025-04-13 20:02:05,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 325 [2025-04-13 20:02:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688063189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:21,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 26 [2025-04-13 20:02:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914686000] [2025-04-13 20:02:21,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:21,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:02:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:21,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:02:21,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:02:21,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:02:21,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 438 transitions, 7455 flow. Second operand has 27 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:02:21,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:21,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:02:21,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:25,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:02:27,350 INFO L116 PetriNetUnfolderBase]: 4350/6560 cut-off events. [2025-04-13 20:02:27,351 INFO L117 PetriNetUnfolderBase]: For 205700/205700 co-relation queries the response was YES. [2025-04-13 20:02:27,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62784 conditions, 6560 events. 4350/6560 cut-off events. For 205700/205700 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 36807 event pairs, 801 based on Foata normal form. 3/6531 useless extension candidates. Maximal degree in co-relation 62614. Up to 5267 conditions per place. [2025-04-13 20:02:27,405 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 311 selfloop transitions, 177 changer transitions 1/489 dead transitions. [2025-04-13 20:02:27,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 489 transitions, 8977 flow [2025-04-13 20:02:27,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:02:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:02:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 156 transitions. [2025-04-13 20:02:27,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.325 [2025-04-13 20:02:27,406 INFO L175 Difference]: Start difference. First operand has 260 places, 438 transitions, 7455 flow. Second operand 16 states and 156 transitions. [2025-04-13 20:02:27,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 489 transitions, 8977 flow [2025-04-13 20:02:28,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 489 transitions, 8506 flow, removed 82 selfloop flow, removed 13 redundant places. [2025-04-13 20:02:28,091 INFO L231 Difference]: Finished difference. Result has 263 places, 441 transitions, 7423 flow [2025-04-13 20:02:28,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=6984, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7423, PETRI_PLACES=263, PETRI_TRANSITIONS=441} [2025-04-13 20:02:28,092 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2025-04-13 20:02:28,092 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 441 transitions, 7423 flow [2025-04-13 20:02:28,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:02:28,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:28,092 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:28,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:02:28,292 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,SelfDestructingSolverStorable27 [2025-04-13 20:02:28,293 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:02:28,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1615082338, now seen corresponding path program 16 times [2025-04-13 20:02:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:28,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960039737] [2025-04-13 20:02:28,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:02:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:28,304 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:02:28,323 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:02:28,324 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:02:28,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:28,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960039737] [2025-04-13 20:02:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960039737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:28,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174890934] [2025-04-13 20:02:28,914 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:02:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:28,916 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:02:28,917 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:02:29,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 20:02:29,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:02:29,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:02:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:29,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:02:29,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:29,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:29,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 20:02:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:29,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:29,600 INFO L325 Elim1Store]: treesize reduction 8, result has 96.5 percent of original size [2025-04-13 20:02:29,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 236 [2025-04-13 20:02:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174890934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:37,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 25 [2025-04-13 20:02:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357517184] [2025-04-13 20:02:37,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:37,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:02:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:37,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:02:37,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:02:37,316 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:02:37,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 441 transitions, 7423 flow. Second operand has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:02:37,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:37,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:02:37,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:39,374 INFO L116 PetriNetUnfolderBase]: 4365/6599 cut-off events. [2025-04-13 20:02:39,374 INFO L117 PetriNetUnfolderBase]: For 207791/207791 co-relation queries the response was YES. [2025-04-13 20:02:39,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62732 conditions, 6599 events. 4365/6599 cut-off events. For 207791/207791 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 37270 event pairs, 802 based on Foata normal form. 3/6570 useless extension candidates. Maximal degree in co-relation 62561. Up to 5105 conditions per place. [2025-04-13 20:02:39,434 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 298 selfloop transitions, 201 changer transitions 1/500 dead transitions. [2025-04-13 20:02:39,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 500 transitions, 9079 flow [2025-04-13 20:02:39,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:02:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:02:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 176 transitions. [2025-04-13 20:02:39,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32592592592592595 [2025-04-13 20:02:39,436 INFO L175 Difference]: Start difference. First operand has 263 places, 441 transitions, 7423 flow. Second operand 18 states and 176 transitions. [2025-04-13 20:02:39,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 500 transitions, 9079 flow [2025-04-13 20:02:40,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 500 transitions, 8829 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-04-13 20:02:40,054 INFO L231 Difference]: Finished difference. Result has 268 places, 444 transitions, 7666 flow [2025-04-13 20:02:40,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7173, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7666, PETRI_PLACES=268, PETRI_TRANSITIONS=444} [2025-04-13 20:02:40,055 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2025-04-13 20:02:40,055 INFO L485 AbstractCegarLoop]: Abstraction has has 268 places, 444 transitions, 7666 flow [2025-04-13 20:02:40,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:02:40,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:40,055 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:40,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 20:02:40,256 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,SelfDestructingSolverStorable28 [2025-04-13 20:02:40,256 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:02:40,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -884339496, now seen corresponding path program 17 times [2025-04-13 20:02:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:40,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331614608] [2025-04-13 20:02:40,257 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:02:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:40,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:02:40,291 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:02:40,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:02:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-13 20:02:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:41,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331614608] [2025-04-13 20:02:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331614608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:41,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145368272] [2025-04-13 20:02:41,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:02:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:41,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:41,032 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:02:41,033 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:02:41,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:02:41,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:02:41,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:02:41,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:41,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 20:02:41,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:41,818 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:41,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 20:02:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:41,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:42,245 INFO L325 Elim1Store]: treesize reduction 8, result has 96.5 percent of original size [2025-04-13 20:02:42,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 236 [2025-04-13 20:02:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145368272] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:54,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:54,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 31 [2025-04-13 20:02:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903192385] [2025-04-13 20:02:54,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:54,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:02:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:02:54,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:02:54,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:02:54,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 444 transitions, 7666 flow. Second operand has 32 states, 32 states have (on average 5.4375) internal successors, (174), 32 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:02:54,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:54,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:02:54,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:58,829 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:03:00,468 INFO L116 PetriNetUnfolderBase]: 4457/6744 cut-off events. [2025-04-13 20:03:00,468 INFO L117 PetriNetUnfolderBase]: For 214701/214701 co-relation queries the response was YES. [2025-04-13 20:03:00,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65047 conditions, 6744 events. 4457/6744 cut-off events. For 214701/214701 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 38245 event pairs, 787 based on Foata normal form. 3/6736 useless extension candidates. Maximal degree in co-relation 64875. Up to 5279 conditions per place. [2025-04-13 20:03:00,525 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 313 selfloop transitions, 198 changer transitions 3/514 dead transitions. [2025-04-13 20:03:00,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 514 transitions, 9583 flow [2025-04-13 20:03:00,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:03:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:03:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 186 transitions. [2025-04-13 20:03:00,526 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3263157894736842 [2025-04-13 20:03:00,526 INFO L175 Difference]: Start difference. First operand has 268 places, 444 transitions, 7666 flow. Second operand 19 states and 186 transitions. [2025-04-13 20:03:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 514 transitions, 9583 flow [2025-04-13 20:03:01,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 514 transitions, 9325 flow, removed 14 selfloop flow, removed 14 redundant places. [2025-04-13 20:03:01,106 INFO L231 Difference]: Finished difference. Result has 275 places, 455 transitions, 8060 flow [2025-04-13 20:03:01,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7410, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8060, PETRI_PLACES=275, PETRI_TRANSITIONS=455} [2025-04-13 20:03:01,107 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2025-04-13 20:03:01,107 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 455 transitions, 8060 flow [2025-04-13 20:03:01,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.4375) internal successors, (174), 32 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:03:01,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:01,107 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:01,114 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:03:01,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:01,308 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:03:01,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1422195074, now seen corresponding path program 18 times [2025-04-13 20:03:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:01,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244389399] [2025-04-13 20:03:01,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:03:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:01,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:03:01,331 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:03:01,331 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:03:01,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:01,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244389399] [2025-04-13 20:03:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244389399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:01,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028974532] [2025-04-13 20:03:01,808 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:03:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:01,810 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:03:01,811 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:03:01,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 20:03:01,965 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 20:03:01,966 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:03:01,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:01,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 20:03:01,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:02,199 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:03:02,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 40 [2025-04-13 20:03:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:02,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:02,791 INFO L325 Elim1Store]: treesize reduction 15, result has 95.3 percent of original size [2025-04-13 20:03:02,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 325 [2025-04-13 20:03:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028974532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:03:14,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:03:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 26 [2025-04-13 20:03:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061044158] [2025-04-13 20:03:14,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:03:14,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:03:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:03:14,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:03:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:03:14,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:03:14,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 455 transitions, 8060 flow. Second operand has 27 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:03:14,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:03:14,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:03:14,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:03:16,632 INFO L116 PetriNetUnfolderBase]: 4549/6889 cut-off events. [2025-04-13 20:03:16,632 INFO L117 PetriNetUnfolderBase]: For 224286/224286 co-relation queries the response was YES. [2025-04-13 20:03:16,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67644 conditions, 6889 events. 4549/6889 cut-off events. For 224286/224286 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 39285 event pairs, 862 based on Foata normal form. 3/6881 useless extension candidates. Maximal degree in co-relation 67465. Up to 5605 conditions per place. [2025-04-13 20:03:16,681 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 334 selfloop transitions, 171 changer transitions 4/509 dead transitions. [2025-04-13 20:03:16,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 509 transitions, 9782 flow [2025-04-13 20:03:16,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:03:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:03:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2025-04-13 20:03:16,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33555555555555555 [2025-04-13 20:03:16,682 INFO L175 Difference]: Start difference. First operand has 275 places, 455 transitions, 8060 flow. Second operand 15 states and 151 transitions. [2025-04-13 20:03:16,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 509 transitions, 9782 flow [2025-04-13 20:03:17,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 509 transitions, 9357 flow, removed 50 selfloop flow, removed 13 redundant places. [2025-04-13 20:03:17,255 INFO L231 Difference]: Finished difference. Result has 278 places, 463 transitions, 8188 flow [2025-04-13 20:03:17,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7636, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8188, PETRI_PLACES=278, PETRI_TRANSITIONS=463} [2025-04-13 20:03:17,255 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2025-04-13 20:03:17,255 INFO L485 AbstractCegarLoop]: Abstraction has has 278 places, 463 transitions, 8188 flow [2025-04-13 20:03:17,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:03:17,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:03:17,256 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:03:17,262 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:03:17,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:17,456 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:03:17,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:03:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -667223298, now seen corresponding path program 19 times [2025-04-13 20:03:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:03:17,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37481416] [2025-04-13 20:03:17,457 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:03:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:03:17,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:03:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:03:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:03:18,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37481416] [2025-04-13 20:03:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37481416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:03:18,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881303231] [2025-04-13 20:03:18,043 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:03:18,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:18,045 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:03:18,046 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:03:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:03:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:03:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:03:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:03:18,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:03:18,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:03:18,398 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:03:18,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 52 [2025-04-13 20:03:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:03:18,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:03:19,006 INFO L325 Elim1Store]: treesize reduction 4, result has 98.8 percent of original size [2025-04-13 20:03:19,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 347 [2025-04-13 20:03:19,210 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 101 [2025-04-13 20:03:19,211 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:03:19,212 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:03:19,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:03:19,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:03:19,413 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:583) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2025-04-13 20:03:19,417 INFO L158 Benchmark]: Toolchain (without parser) took 243015.82ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 100.0MB in the beginning and 898.4MB in the end (delta: -798.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 20:03:19,417 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:03:19,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.09ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.8MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:03:19,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:03:19,417 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:03:19,418 INFO L158 Benchmark]: RCFGBuilder took 677.18ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 52.8MB in the end (delta: 26.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-13 20:03:19,418 INFO L158 Benchmark]: TraceAbstraction took 242016.46ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 52.8MB in the beginning and 898.4MB in the end (delta: -845.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 20:03:19,418 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 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.09ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.8MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 677.18ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 52.8MB in the end (delta: 26.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 242016.46ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 52.8MB in the beginning and 898.4MB in the end (delta: -845.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...