/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:01:14,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:01:14,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:01:14,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:01:14,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:01:14,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:01:14,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:01:14,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:01:14,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:01:14,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:01:14,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:01:14,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:01:14,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:01:14,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:14,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:14,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:14,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:14,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:14,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:01:14,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:01:15,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:01:15,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:01:15,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:01:15,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:01:15,069 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:01:15,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2025-04-14 01:01:16,351 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94909f187/9769f70ec8744dbc945e150f38869930/FLAG871100aaf [2025-04-14 01:01:16,561 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:01:16,561 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2025-04-14 01:01:16,567 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94909f187/9769f70ec8744dbc945e150f38869930/FLAG871100aaf [2025-04-14 01:01:17,400 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94909f187/9769f70ec8744dbc945e150f38869930 [2025-04-14 01:01:17,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:01:17,404 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:01:17,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:17,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:01:17,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:01:17,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d28b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17, skipping insertion in model container [2025-04-14 01:01:17,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:01:17,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4643,4656] [2025-04-14 01:01:17,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:17,638 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:01:17,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4643,4656] [2025-04-14 01:01:17,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:17,690 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:01:17,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17 WrapperNode [2025-04-14 01:01:17,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:17,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:17,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:01:17,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:01:17,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,739 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-04-14 01:01:17,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:17,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:01:17,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:01:17,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:01:17,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,771 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-14 01:01:17,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:01:17,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:01:17,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:01:17,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:01:17,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (1/1) ... [2025-04-14 01:01:17,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:17,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:01:17,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:01:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:01:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:01:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:01:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:01:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:01:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:01:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:01:17,851 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:01:17,944 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:01:17,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:01:18,324 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:01:18,324 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:01:18,324 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:01:18,631 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:01:18,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:18 BoogieIcfgContainer [2025-04-14 01:01:18,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:01:18,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:01:18,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:01:18,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:01:18,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:01:17" (1/3) ... [2025-04-14 01:01:18,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1827096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:18, skipping insertion in model container [2025-04-14 01:01:18,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:17" (2/3) ... [2025-04-14 01:01:18,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1827096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:18, skipping insertion in model container [2025-04-14 01:01:18,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:18" (3/3) ... [2025-04-14 01:01:18,637 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-04-14 01:01:18,647 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:01:18,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 33 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 01:01:18,649 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:01:18,730 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:01:18,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 97 flow [2025-04-14 01:01:18,782 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-14 01:01:18,785 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:01:18,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-14 01:01:18,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 97 flow [2025-04-14 01:01:18,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 86 flow [2025-04-14 01:01:18,797 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:01:18,810 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;@2b1b47be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:01:18,810 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:01:18,824 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:01:18,824 INFO L116 PetriNetUnfolderBase]: 6/33 cut-off events. [2025-04-14 01:01:18,824 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:01:18,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:18,825 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-14 01:01:18,826 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-14 01:01:18,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1508564497, now seen corresponding path program 1 times [2025-04-14 01:01:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:18,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940313807] [2025-04-14 01:01:18,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:18,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:01:18,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:01:18,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:19,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940313807] [2025-04-14 01:01:19,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940313807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:19,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:19,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:01:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799038834] [2025-04-14 01:01:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:19,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:01:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:19,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:01:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:01:19,209 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:19,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-14 01:01:19,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:19,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:19,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:19,550 INFO L116 PetriNetUnfolderBase]: 1542/2132 cut-off events. [2025-04-14 01:01:19,550 INFO L117 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-04-14 01:01:19,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 2132 events. 1542/2132 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9431 event pairs, 276 based on Foata normal form. 1/1587 useless extension candidates. Maximal degree in co-relation 4053. Up to 1837 conditions per place. [2025-04-14 01:01:19,570 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 44 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2025-04-14 01:01:19,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 235 flow [2025-04-14 01:01:19,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:01:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:01:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 01:01:19,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-14 01:01:19,580 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 86 flow. Second operand 3 states and 68 transitions. [2025-04-14 01:01:19,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 235 flow [2025-04-14 01:01:19,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:01:19,592 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 100 flow [2025-04-14 01:01:19,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-14 01:01:19,598 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-04-14 01:01:19,599 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 100 flow [2025-04-14 01:01:19,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-14 01:01:19,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:19,599 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-14 01:01:19,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:01:19,600 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-14 01:01:19,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 295096548, now seen corresponding path program 1 times [2025-04-14 01:01:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:19,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658098851] [2025-04-14 01:01:19,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:19,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:01:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:01:19,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:19,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:19,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658098851] [2025-04-14 01:01:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658098851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875061618] [2025-04-14 01:01:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:19,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:01:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:19,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:01:19,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:01:19,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:19,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:19,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:19,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:19,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:20,075 INFO L116 PetriNetUnfolderBase]: 1552/2214 cut-off events. [2025-04-14 01:01:20,076 INFO L117 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-04-14 01:01:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4837 conditions, 2214 events. 1552/2214 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10197 event pairs, 536 based on Foata normal form. 73/1738 useless extension candidates. Maximal degree in co-relation 1893. Up to 1520 conditions per place. [2025-04-14 01:01:20,088 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 50 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-04-14 01:01:20,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 248 flow [2025-04-14 01:01:20,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:01:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:01:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-14 01:01:20,090 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-04-14 01:01:20,090 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 100 flow. Second operand 3 states and 69 transitions. [2025-04-14 01:01:20,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 248 flow [2025-04-14 01:01:20,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:20,092 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 104 flow [2025-04-14 01:01:20,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-04-14 01:01:20,093 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-04-14 01:01:20,093 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 104 flow [2025-04-14 01:01:20,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:20,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:20,093 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-14 01:01:20,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:01:20,093 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-14 01:01:20,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1958249611, now seen corresponding path program 1 times [2025-04-14 01:01:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:20,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677134093] [2025-04-14 01:01:20,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:20,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:01:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:01:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:20,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677134093] [2025-04-14 01:01:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677134093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133255585] [2025-04-14 01:01:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:20,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:01:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:20,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:01:20,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:01:20,227 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:20,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:20,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:20,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:20,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:20,460 INFO L116 PetriNetUnfolderBase]: 1580/2253 cut-off events. [2025-04-14 01:01:20,460 INFO L117 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-04-14 01:01:20,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 2253 events. 1580/2253 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10222 event pairs, 461 based on Foata normal form. 48/1767 useless extension candidates. Maximal degree in co-relation 1295. Up to 1537 conditions per place. [2025-04-14 01:01:20,470 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 46 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2025-04-14 01:01:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 251 flow [2025-04-14 01:01:20,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:01:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:01:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-14 01:01:20,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2025-04-14 01:01:20,472 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 104 flow. Second operand 3 states and 71 transitions. [2025-04-14 01:01:20,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 251 flow [2025-04-14 01:01:20,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:20,473 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 110 flow [2025-04-14 01:01:20,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-14 01:01:20,473 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-04-14 01:01:20,473 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 110 flow [2025-04-14 01:01:20,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:20,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:20,474 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, 1] [2025-04-14 01:01:20,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:01:20,474 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-14 01:01:20,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1326766698, now seen corresponding path program 1 times [2025-04-14 01:01:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:20,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943483624] [2025-04-14 01:01:20,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:20,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:01:20,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:01:20,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:20,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:20,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943483624] [2025-04-14 01:01:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943483624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:01:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971630224] [2025-04-14 01:01:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:20,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:01:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:20,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:01:20,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:01:20,576 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:20,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-14 01:01:20,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:20,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:20,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:20,718 INFO L116 PetriNetUnfolderBase]: 909/1331 cut-off events. [2025-04-14 01:01:20,718 INFO L117 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-04-14 01:01:20,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3068 conditions, 1331 events. 909/1331 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5290 event pairs, 400 based on Foata normal form. 26/1033 useless extension candidates. Maximal degree in co-relation 744. Up to 1097 conditions per place. [2025-04-14 01:01:20,725 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 5/48 dead transitions. [2025-04-14 01:01:20,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 225 flow [2025-04-14 01:01:20,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:01:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:01:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-14 01:01:20,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-04-14 01:01:20,726 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 110 flow. Second operand 3 states and 61 transitions. [2025-04-14 01:01:20,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 225 flow [2025-04-14 01:01:20,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:20,728 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 120 flow [2025-04-14 01:01:20,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-04-14 01:01:20,729 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-04-14 01:01:20,729 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 120 flow [2025-04-14 01:01:20,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-14 01:01:20,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:20,730 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, 1, 1, 1, 1] [2025-04-14 01:01:20,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:01:20,730 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-14 01:01:20,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -944674542, now seen corresponding path program 1 times [2025-04-14 01:01:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:20,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414507786] [2025-04-14 01:01:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:20,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:01:20,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:01:20,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:20,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:20,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:20,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414507786] [2025-04-14 01:01:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414507786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:20,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019112784] [2025-04-14 01:01:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:20,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:20,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:20,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:20,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:20,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:20,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:20,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:21,053 INFO L116 PetriNetUnfolderBase]: 1037/1569 cut-off events. [2025-04-14 01:01:21,053 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-14 01:01:21,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1569 events. 1037/1569 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6775 event pairs, 812 based on Foata normal form. 22/1187 useless extension candidates. Maximal degree in co-relation 1262. Up to 1319 conditions per place. [2025-04-14 01:01:21,062 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 34 selfloop transitions, 2 changer transitions 24/63 dead transitions. [2025-04-14 01:01:21,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 296 flow [2025-04-14 01:01:21,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-14 01:01:21,064 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45789473684210524 [2025-04-14 01:01:21,064 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 120 flow. Second operand 5 states and 87 transitions. [2025-04-14 01:01:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 296 flow [2025-04-14 01:01:21,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:21,066 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 140 flow [2025-04-14 01:01:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-04-14 01:01:21,067 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-04-14 01:01:21,067 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 140 flow [2025-04-14 01:01:21,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:21,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:21,067 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, 1, 1, 1, 1, 1] [2025-04-14 01:01:21,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:01:21,067 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-14 01:01:21,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1026526952, now seen corresponding path program 1 times [2025-04-14 01:01:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:21,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599383222] [2025-04-14 01:01:21,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:21,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:01:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:01:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:01:21,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:21,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599383222] [2025-04-14 01:01:21,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599383222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:21,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:21,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573682548] [2025-04-14 01:01:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:21,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:21,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:21,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:21,212 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:21,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:21,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:21,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:21,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:21,382 INFO L116 PetriNetUnfolderBase]: 1111/1690 cut-off events. [2025-04-14 01:01:21,383 INFO L117 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2025-04-14 01:01:21,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1690 events. 1111/1690 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7671 event pairs, 880 based on Foata normal form. 10/1277 useless extension candidates. Maximal degree in co-relation 3961. Up to 1317 conditions per place. [2025-04-14 01:01:21,390 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 33 selfloop transitions, 4 changer transitions 26/66 dead transitions. [2025-04-14 01:01:21,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 352 flow [2025-04-14 01:01:21,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-04-14 01:01:21,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-14 01:01:21,392 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 140 flow. Second operand 5 states and 90 transitions. [2025-04-14 01:01:21,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 352 flow [2025-04-14 01:01:21,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 324 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-04-14 01:01:21,395 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 152 flow [2025-04-14 01:01:21,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-04-14 01:01:21,396 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-04-14 01:01:21,396 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 152 flow [2025-04-14 01:01:21,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:21,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:21,396 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:21,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:01:21,396 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-14 01:01:21,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1334074854, now seen corresponding path program 1 times [2025-04-14 01:01:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:21,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307286553] [2025-04-14 01:01:21,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 01:01:21,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:01:21,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:21,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307286553] [2025-04-14 01:01:21,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307286553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748042773] [2025-04-14 01:01:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:21,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:21,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:21,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:21,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:21,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:21,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:21,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:21,693 INFO L116 PetriNetUnfolderBase]: 1079/1637 cut-off events. [2025-04-14 01:01:21,694 INFO L117 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2025-04-14 01:01:21,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 1637 events. 1079/1637 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7402 event pairs, 858 based on Foata normal form. 6/1229 useless extension candidates. Maximal degree in co-relation 3799. Up to 1315 conditions per place. [2025-04-14 01:01:21,700 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 32 selfloop transitions, 6 changer transitions 18/59 dead transitions. [2025-04-14 01:01:21,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 318 flow [2025-04-14 01:01:21,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-14 01:01:21,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4368421052631579 [2025-04-14 01:01:21,701 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 152 flow. Second operand 5 states and 83 transitions. [2025-04-14 01:01:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 318 flow [2025-04-14 01:01:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 298 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:21,703 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 162 flow [2025-04-14 01:01:21,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-14 01:01:21,704 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-04-14 01:01:21,704 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 162 flow [2025-04-14 01:01:21,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:21,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:21,704 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:21,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:01:21,704 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-14 01:01:21,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -900129020, now seen corresponding path program 1 times [2025-04-14 01:01:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:21,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832936317] [2025-04-14 01:01:21,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:21,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:01:21,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:01:21,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:21,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:21,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832936317] [2025-04-14 01:01:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832936317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:21,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519386250] [2025-04-14 01:01:21,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:21,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:01:22,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:01:22,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:01:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:22,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:01:22,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:22,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:01:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519386250] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:22,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-14 01:01:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485826081] [2025-04-14 01:01:22,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:22,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:01:22,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:22,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:01:22,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:01:22,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:22,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 162 flow. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:22,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:22,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:22,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:22,534 INFO L116 PetriNetUnfolderBase]: 1089/1660 cut-off events. [2025-04-14 01:01:22,534 INFO L117 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-04-14 01:01:22,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 1660 events. 1089/1660 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7358 event pairs, 524 based on Foata normal form. 10/1255 useless extension candidates. Maximal degree in co-relation 3156. Up to 1097 conditions per place. [2025-04-14 01:01:22,542 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 40 selfloop transitions, 4 changer transitions 41/88 dead transitions. [2025-04-14 01:01:22,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 479 flow [2025-04-14 01:01:22,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:01:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:01:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-04-14 01:01:22,544 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-14 01:01:22,544 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 162 flow. Second operand 8 states and 128 transitions. [2025-04-14 01:01:22,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 479 flow [2025-04-14 01:01:22,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 455 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 01:01:22,547 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 172 flow [2025-04-14 01:01:22,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2025-04-14 01:01:22,548 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-04-14 01:01:22,548 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 172 flow [2025-04-14 01:01:22,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:22,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:22,549 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:22,556 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-14 01:01:22,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:22,754 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-14 01:01:22,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -176778114, now seen corresponding path program 2 times [2025-04-14 01:01:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:22,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724943150] [2025-04-14 01:01:22,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:22,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:01:22,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 32 statements. [2025-04-14 01:01:22,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:01:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:01:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:22,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724943150] [2025-04-14 01:01:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724943150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:22,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944157824] [2025-04-14 01:01:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:22,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:01:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:22,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:01:22,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:01:22,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:22,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:22,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:22,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:22,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:23,093 INFO L116 PetriNetUnfolderBase]: 1727/2557 cut-off events. [2025-04-14 01:01:23,093 INFO L117 PetriNetUnfolderBase]: For 1275/1275 co-relation queries the response was YES. [2025-04-14 01:01:23,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 2557 events. 1727/2557 cut-off events. For 1275/1275 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10509 event pairs, 779 based on Foata normal form. 72/2102 useless extension candidates. Maximal degree in co-relation 6522. Up to 906 conditions per place. [2025-04-14 01:01:23,106 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 68 selfloop transitions, 9 changer transitions 0/80 dead transitions. [2025-04-14 01:01:23,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 452 flow [2025-04-14 01:01:23,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:01:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:01:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-14 01:01:23,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-04-14 01:01:23,108 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 172 flow. Second operand 4 states and 93 transitions. [2025-04-14 01:01:23,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 452 flow [2025-04-14 01:01:23,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 440 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:23,110 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 229 flow [2025-04-14 01:01:23,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2025-04-14 01:01:23,112 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-04-14 01:01:23,112 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 229 flow [2025-04-14 01:01:23,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:23,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:23,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:23,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:01:23,112 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-14 01:01:23,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1304074667, now seen corresponding path program 1 times [2025-04-14 01:01:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:23,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462505086] [2025-04-14 01:01:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:23,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:01:23,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:01:23,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:23,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:23,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462505086] [2025-04-14 01:01:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462505086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:23,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718408065] [2025-04-14 01:01:23,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:23,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:23,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:01:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:01:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:01:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:23,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:23,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:01:23,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:23,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718408065] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:23,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:01:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243768878] [2025-04-14 01:01:23,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:23,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:01:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:23,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:01:23,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:01:23,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:23,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 229 flow. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:23,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:23,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:23,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:23,994 INFO L116 PetriNetUnfolderBase]: 2156/3329 cut-off events. [2025-04-14 01:01:23,994 INFO L117 PetriNetUnfolderBase]: For 3300/3300 co-relation queries the response was YES. [2025-04-14 01:01:23,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9496 conditions, 3329 events. 2156/3329 cut-off events. For 3300/3300 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15569 event pairs, 1583 based on Foata normal form. 183/2819 useless extension candidates. Maximal degree in co-relation 9458. Up to 2540 conditions per place. [2025-04-14 01:01:24,006 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 40 selfloop transitions, 6 changer transitions 45/94 dead transitions. [2025-04-14 01:01:24,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 616 flow [2025-04-14 01:01:24,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:01:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:01:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2025-04-14 01:01:24,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3526315789473684 [2025-04-14 01:01:24,007 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 229 flow. Second operand 10 states and 134 transitions. [2025-04-14 01:01:24,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 616 flow [2025-04-14 01:01:24,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 590 flow, removed 13 selfloop flow, removed 0 redundant places. [2025-04-14 01:01:24,011 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 247 flow [2025-04-14 01:01:24,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-04-14 01:01:24,011 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2025-04-14 01:01:24,011 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 247 flow [2025-04-14 01:01:24,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:24,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:24,016 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:24,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:24,216 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,SelfDestructingSolverStorable9 [2025-04-14 01:01:24,216 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-14 01:01:24,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1163802087, now seen corresponding path program 2 times [2025-04-14 01:01:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:24,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714002132] [2025-04-14 01:01:24,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:24,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-14 01:01:24,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 36 statements. [2025-04-14 01:01:24,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:01:24,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:01:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:25,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714002132] [2025-04-14 01:01:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714002132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-14 01:01:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11833593] [2025-04-14 01:01:25,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:25,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:01:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:01:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:01:25,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:25,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 247 flow. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:25,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:25,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:25,561 INFO L116 PetriNetUnfolderBase]: 1963/2905 cut-off events. [2025-04-14 01:01:25,562 INFO L117 PetriNetUnfolderBase]: For 2811/2811 co-relation queries the response was YES. [2025-04-14 01:01:25,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8434 conditions, 2905 events. 1963/2905 cut-off events. For 2811/2811 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11856 event pairs, 580 based on Foata normal form. 1/2293 useless extension candidates. Maximal degree in co-relation 8387. Up to 2264 conditions per place. [2025-04-14 01:01:25,574 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 75 selfloop transitions, 15 changer transitions 12/105 dead transitions. [2025-04-14 01:01:25,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 105 transitions, 629 flow [2025-04-14 01:01:25,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:01:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:01:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2025-04-14 01:01:25,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3973684210526316 [2025-04-14 01:01:25,575 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 247 flow. Second operand 10 states and 151 transitions. [2025-04-14 01:01:25,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 105 transitions, 629 flow [2025-04-14 01:01:25,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 601 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-04-14 01:01:25,579 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 347 flow [2025-04-14 01:01:25,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2025-04-14 01:01:25,579 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-04-14 01:01:25,580 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 347 flow [2025-04-14 01:01:25,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:25,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:25,580 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-14 01:01:25,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:01:25,580 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-14 01:01:25,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash -220059368, now seen corresponding path program 3 times [2025-04-14 01:01:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:25,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357143908] [2025-04-14 01:01:25,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:25,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-14 01:01:25,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 01:01:25,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:01:25,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:01:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:25,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357143908] [2025-04-14 01:01:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357143908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:25,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569756854] [2025-04-14 01:01:25,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:25,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:25,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:25,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:25,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:01:25,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-14 01:01:25,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 01:01:25,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:01:25,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:25,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:01:25,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:01:26,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:01:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569756854] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:26,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-14 01:01:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163488732] [2025-04-14 01:01:26,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:26,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:01:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:26,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:01:26,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:01:26,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:26,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 347 flow. Second operand has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:26,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:26,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:26,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:26,644 INFO L116 PetriNetUnfolderBase]: 2787/4239 cut-off events. [2025-04-14 01:01:26,644 INFO L117 PetriNetUnfolderBase]: For 5366/5366 co-relation queries the response was YES. [2025-04-14 01:01:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12493 conditions, 4239 events. 2787/4239 cut-off events. For 5366/5366 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20217 event pairs, 1818 based on Foata normal form. 166/3464 useless extension candidates. Maximal degree in co-relation 8735. Up to 2891 conditions per place. [2025-04-14 01:01:26,660 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 95 selfloop transitions, 8 changer transitions 16/122 dead transitions. [2025-04-14 01:01:26,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 891 flow [2025-04-14 01:01:26,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:01:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:01:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-04-14 01:01:26,662 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39766081871345027 [2025-04-14 01:01:26,662 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 347 flow. Second operand 9 states and 136 transitions. [2025-04-14 01:01:26,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 891 flow [2025-04-14 01:01:26,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 122 transitions, 831 flow, removed 27 selfloop flow, removed 2 redundant places. [2025-04-14 01:01:26,668 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 398 flow [2025-04-14 01:01:26,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-04-14 01:01:26,669 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2025-04-14 01:01:26,669 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 398 flow [2025-04-14 01:01:26,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:26,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:26,670 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-14 01:01:26,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:01:26,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:26,870 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-14 01:01:26,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1429851540, now seen corresponding path program 4 times [2025-04-14 01:01:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:26,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-14 01:01:26,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:26,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-14 01:01:26,898 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 01:01:26,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:27,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:27,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-14 01:01:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862608188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:27,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106886333] [2025-04-14 01:01:27,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:27,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:27,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:01:27,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-14 01:01:27,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 01:01:27,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:27,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:27,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:01:27,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:27,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106886333] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:27,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-14 01:01:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866886383] [2025-04-14 01:01:27,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:27,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:01:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:01:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:01:27,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:27,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 398 flow. Second operand has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:27,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:27,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:27,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:27,755 INFO L116 PetriNetUnfolderBase]: 2147/3244 cut-off events. [2025-04-14 01:01:27,756 INFO L117 PetriNetUnfolderBase]: For 4312/4312 co-relation queries the response was YES. [2025-04-14 01:01:27,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9786 conditions, 3244 events. 2147/3244 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14524 event pairs, 1562 based on Foata normal form. 2/2539 useless extension candidates. Maximal degree in co-relation 8895. Up to 2891 conditions per place. [2025-04-14 01:01:27,767 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 54 selfloop transitions, 4 changer transitions 39/100 dead transitions. [2025-04-14 01:01:27,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 100 transitions, 701 flow [2025-04-14 01:01:27,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:01:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:01:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-04-14 01:01:27,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3654970760233918 [2025-04-14 01:01:27,768 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 398 flow. Second operand 9 states and 125 transitions. [2025-04-14 01:01:27,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 100 transitions, 701 flow [2025-04-14 01:01:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 100 transitions, 677 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:27,773 INFO L231 Difference]: Finished difference. Result has 88 places, 61 transitions, 345 flow [2025-04-14 01:01:27,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=88, PETRI_TRANSITIONS=61} [2025-04-14 01:01:27,774 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2025-04-14 01:01:27,774 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 61 transitions, 345 flow [2025-04-14 01:01:27,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:27,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:27,774 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-14 01:01:27,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:27,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:27,975 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-14 01:01:27,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1604877166, now seen corresponding path program 5 times [2025-04-14 01:01:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:27,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031385350] [2025-04-14 01:01:27,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:01:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:27,989 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-14 01:01:28,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:01:28,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:01:28,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:01:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:28,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031385350] [2025-04-14 01:01:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031385350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:28,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016718781] [2025-04-14 01:01:28,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:01:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:28,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:28,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:01:28,181 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-14 01:01:28,218 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:01:28,218 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:01:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:28,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:01:28,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:01:28,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:01:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016718781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:28,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:01:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089699188] [2025-04-14 01:01:28,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:28,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:01:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:01:28,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:01:28,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:28,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 61 transitions, 345 flow. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:28,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:28,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:28,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:28,900 INFO L116 PetriNetUnfolderBase]: 2757/4195 cut-off events. [2025-04-14 01:01:28,900 INFO L117 PetriNetUnfolderBase]: For 4998/4998 co-relation queries the response was YES. [2025-04-14 01:01:28,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12105 conditions, 4195 events. 2757/4195 cut-off events. For 4998/4998 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19533 event pairs, 1673 based on Foata normal form. 184/3406 useless extension candidates. Maximal degree in co-relation 12056. Up to 2592 conditions per place. [2025-04-14 01:01:28,912 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 87 selfloop transitions, 10 changer transitions 18/118 dead transitions. [2025-04-14 01:01:28,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 118 transitions, 805 flow [2025-04-14 01:01:28,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:01:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:01:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2025-04-14 01:01:28,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37320574162679426 [2025-04-14 01:01:28,913 INFO L175 Difference]: Start difference. First operand has 88 places, 61 transitions, 345 flow. Second operand 11 states and 156 transitions. [2025-04-14 01:01:28,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 118 transitions, 805 flow [2025-04-14 01:01:28,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 118 transitions, 771 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-04-14 01:01:28,920 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 383 flow [2025-04-14 01:01:28,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2025-04-14 01:01:28,920 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2025-04-14 01:01:28,920 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 383 flow [2025-04-14 01:01:28,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:28,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:28,921 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-14 01:01:28,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:01:29,121 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,SelfDestructingSolverStorable13 [2025-04-14 01:01:29,121 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-14 01:01:29,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -734061781, now seen corresponding path program 6 times [2025-04-14 01:01:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:29,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838706687] [2025-04-14 01:01:29,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:01:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:29,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-14 01:01:29,141 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 34 of 40 statements. [2025-04-14 01:01:29,141 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:01:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 01:01:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:29,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838706687] [2025-04-14 01:01:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838706687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:29,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182145526] [2025-04-14 01:01:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:29,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:29,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:29,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:29,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-14 01:01:29,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:29,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:29,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:29,815 INFO L116 PetriNetUnfolderBase]: 5092/7561 cut-off events. [2025-04-14 01:01:29,815 INFO L117 PetriNetUnfolderBase]: For 10892/10892 co-relation queries the response was YES. [2025-04-14 01:01:29,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22954 conditions, 7561 events. 5092/7561 cut-off events. For 10892/10892 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 35062 event pairs, 2172 based on Foata normal form. 180/6121 useless extension candidates. Maximal degree in co-relation 22898. Up to 3231 conditions per place. [2025-04-14 01:01:29,847 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 100 selfloop transitions, 7 changer transitions 3/113 dead transitions. [2025-04-14 01:01:29,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 113 transitions, 844 flow [2025-04-14 01:01:29,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:01:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:01:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-14 01:01:29,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-04-14 01:01:29,848 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 383 flow. Second operand 4 states and 93 transitions. [2025-04-14 01:01:29,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 113 transitions, 844 flow [2025-04-14 01:01:29,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 113 transitions, 828 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-14 01:01:29,859 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 388 flow [2025-04-14 01:01:29,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2025-04-14 01:01:29,859 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2025-04-14 01:01:29,859 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 388 flow [2025-04-14 01:01:29,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-14 01:01:29,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:29,859 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-14 01:01:29,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:01:29,859 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-14 01:01:29,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1528737120, now seen corresponding path program 7 times [2025-04-14 01:01:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:29,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923320706] [2025-04-14 01:01:29,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:01:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 01:01:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 01:01:29,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:29,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 01:01:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:29,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923320706] [2025-04-14 01:01:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923320706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:01:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355813791] [2025-04-14 01:01:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:29,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:29,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:29,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:29,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:29,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:29,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:30,077 INFO L116 PetriNetUnfolderBase]: 580/992 cut-off events. [2025-04-14 01:01:30,078 INFO L117 PetriNetUnfolderBase]: For 1396/1396 co-relation queries the response was YES. [2025-04-14 01:01:30,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 992 events. 580/992 cut-off events. For 1396/1396 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3848 event pairs, 557 based on Foata normal form. 80/780 useless extension candidates. Maximal degree in co-relation 2624. Up to 953 conditions per place. [2025-04-14 01:01:30,081 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 44 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2025-04-14 01:01:30,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 53 transitions, 396 flow [2025-04-14 01:01:30,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:01:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:01:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-14 01:01:30,082 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2025-04-14 01:01:30,082 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 388 flow. Second operand 4 states and 59 transitions. [2025-04-14 01:01:30,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 53 transitions, 396 flow [2025-04-14 01:01:30,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 53 transitions, 333 flow, removed 5 selfloop flow, removed 13 redundant places. [2025-04-14 01:01:30,086 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 237 flow [2025-04-14 01:01:30,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2025-04-14 01:01:30,086 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-04-14 01:01:30,087 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 237 flow [2025-04-14 01:01:30,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:30,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:30,087 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:30,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:01:30,087 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-14 01:01:30,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -246458085, now seen corresponding path program 8 times [2025-04-14 01:01:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:30,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103883015] [2025-04-14 01:01:30,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:30,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 01:01:30,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 01:01:30,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 01:01:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:30,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103883015] [2025-04-14 01:01:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103883015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:30,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490760578] [2025-04-14 01:01:30,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:30,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:30,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:01:30,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 01:01:30,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 01:01:30,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:30,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:30,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:01:30,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 01:01:30,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 01:01:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490760578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:31,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-04-14 01:01:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056825483] [2025-04-14 01:01:31,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:31,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:01:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:31,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:01:31,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:01:31,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:31,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 237 flow. Second operand has 22 states, 22 states have (on average 11.227272727272727) internal successors, (247), 22 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:31,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:31,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:31,473 INFO L116 PetriNetUnfolderBase]: 996/1724 cut-off events. [2025-04-14 01:01:31,473 INFO L117 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-04-14 01:01:31,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3988 conditions, 1724 events. 996/1724 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7881 event pairs, 763 based on Foata normal form. 22/1249 useless extension candidates. Maximal degree in co-relation 3969. Up to 973 conditions per place. [2025-04-14 01:01:31,479 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 40 selfloop transitions, 8 changer transitions 59/110 dead transitions. [2025-04-14 01:01:31,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 668 flow [2025-04-14 01:01:31,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:01:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:01:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2025-04-14 01:01:31,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33646616541353386 [2025-04-14 01:01:31,480 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 237 flow. Second operand 14 states and 179 transitions. [2025-04-14 01:01:31,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 668 flow [2025-04-14 01:01:31,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 650 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:01:31,484 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 265 flow [2025-04-14 01:01:31,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=265, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-04-14 01:01:31,484 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2025-04-14 01:01:31,484 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 265 flow [2025-04-14 01:01:31,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.227272727272727) internal successors, (247), 22 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:31,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:31,485 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:31,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:31,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:01:31,685 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-14 01:01:31,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1148244455, now seen corresponding path program 9 times [2025-04-14 01:01:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:31,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351099775] [2025-04-14 01:01:31,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:31,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-04-14 01:01:31,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 50 statements. [2025-04-14 01:01:31,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:01:31,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 01:01:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:31,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351099775] [2025-04-14 01:01:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351099775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:31,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975985829] [2025-04-14 01:01:31,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:31,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:31,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:31,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:31,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:01:32,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-04-14 01:01:32,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 50 statements. [2025-04-14 01:01:32,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:01:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:32,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:01:32,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 01:01:32,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 01:01:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975985829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:32,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-04-14 01:01:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136272770] [2025-04-14 01:01:32,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:32,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:01:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:32,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:01:32,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:01:32,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 01:01:32,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 265 flow. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 26 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:32,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:32,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 01:01:32,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:33,102 INFO L116 PetriNetUnfolderBase]: 964/1663 cut-off events. [2025-04-14 01:01:33,102 INFO L117 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2025-04-14 01:01:33,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3950 conditions, 1663 events. 964/1663 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7599 event pairs, 743 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 3925. Up to 978 conditions per place. [2025-04-14 01:01:33,107 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 44 selfloop transitions, 5 changer transitions 67/119 dead transitions. [2025-04-14 01:01:33,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 756 flow [2025-04-14 01:01:33,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:01:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:01:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2025-04-14 01:01:33,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37280701754385964 [2025-04-14 01:01:33,108 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 265 flow. Second operand 12 states and 170 transitions. [2025-04-14 01:01:33,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 756 flow [2025-04-14 01:01:33,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 119 transitions, 708 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-04-14 01:01:33,112 INFO L231 Difference]: Finished difference. Result has 89 places, 52 transitions, 271 flow [2025-04-14 01:01:33,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=271, PETRI_PLACES=89, PETRI_TRANSITIONS=52} [2025-04-14 01:01:33,112 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2025-04-14 01:01:33,113 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 52 transitions, 271 flow [2025-04-14 01:01:33,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 26 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:33,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:33,113 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:33,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:01:33,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:33,314 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-14 01:01:33,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1399571039, now seen corresponding path program 10 times [2025-04-14 01:01:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:33,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169148280] [2025-04-14 01:01:33,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:33,334 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-14 01:01:33,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-14 01:01:33,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:33,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:38,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169148280] [2025-04-14 01:01:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169148280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:38,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949416060] [2025-04-14 01:01:38,257 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:38,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:38,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:38,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:01:38,364 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-14 01:01:38,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-14 01:01:38,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:38,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-04-14 01:01:38,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:38,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:01:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:01:40,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:02:14,276 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:02:14,276 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 925 treesize of output 897 [2025-04-14 01:02:14,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2025-04-14 01:02:14,617 INFO L325 Elim1Store]: treesize reduction 10, result has 91.5 percent of original size [2025-04-14 01:02:14,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 275 treesize of output 350 [2025-04-14 01:02:16,825 INFO L325 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-04-14 01:02:16,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 159 [2025-04-14 01:04:30,624 WARN L286 SmtUtils]: Spent 2.20m on a formula simplification. DAG size of input: 3335 DAG size of output: 3257 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-14 01:04:30,626 INFO L325 Elim1Store]: treesize reduction 226, result has 98.1 percent of original size [2025-04-14 01:04:30,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 42 select indices, 42 select index equivalence classes, 0 disjoint index pairs (out of 861 index pairs), introduced 42 new quantified variables, introduced 861 case distinctions, treesize of input 2017 treesize of output 12971 [2025-04-14 01:08:00,624 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-14 01:08:00,624 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-14 01:08:00,625 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:08:00,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:08:00,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:00,827 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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:589) 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:142) 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$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.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) ... 69 more [2025-04-14 01:08:00,833 INFO L158 Benchmark]: Toolchain (without parser) took 403428.37ms. Allocated memory was 142.6MB in the beginning and 775.9MB in the end (delta: 633.3MB). Free memory was 97.4MB in the beginning and 617.9MB in the end (delta: -520.5MB). Peak memory consumption was 492.9MB. Max. memory is 8.0GB. [2025-04-14 01:08:00,833 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:08:00,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 81.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:08:00,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 78.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:08:00,833 INFO L158 Benchmark]: Boogie Preprocessor took 56.31ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:08:00,834 INFO L158 Benchmark]: IcfgBuilder took 831.43ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 35.2MB in the end (delta: 40.6MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-14 01:08:00,834 INFO L158 Benchmark]: TraceAbstraction took 402199.65ms. Allocated memory was 142.6MB in the beginning and 775.9MB in the end (delta: 633.3MB). Free memory was 34.6MB in the beginning and 617.9MB in the end (delta: -583.4MB). Peak memory consumption was 431.4MB. Max. memory is 8.0GB. [2025-04-14 01:08:00,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 81.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 78.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.31ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 831.43ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 35.2MB in the end (delta: 40.6MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 402199.65ms. Allocated memory was 142.6MB in the beginning and 775.9MB in the end (delta: 633.3MB). Free memory was 34.6MB in the beginning and 617.9MB in the end (delta: -583.4MB). Peak memory consumption was 431.4MB. 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...