./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:36:35,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:36:35,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:36:35,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:36:35,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:36:35,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:36:35,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:36:35,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:36:35,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:36:35,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:36:35,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:36:35,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:36:35,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:36:35,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:36:35,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:36:35,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:36:35,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:36:35,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:35,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:36:35,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:36:35,789 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-02-06 04:36:35,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:36:35,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:36:35,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:36:35,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:36:35,989 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:36:35,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-02-06 04:36:37,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff641e7c/5c728981cb8d455f859f3b29a8262cca/FLAG1a2f6bbd5 [2025-02-06 04:36:37,311 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:36:37,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-02-06 04:36:37,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff641e7c/5c728981cb8d455f859f3b29a8262cca/FLAG1a2f6bbd5 [2025-02-06 04:36:37,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff641e7c/5c728981cb8d455f859f3b29a8262cca [2025-02-06 04:36:37,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:36:37,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:36:37,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:37,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:36:37,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:36:37,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170ffd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37, skipping insertion in model container [2025-02-06 04:36:37,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:36:37,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-02-06 04:36:37,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:37,793 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:36:37,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-02-06 04:36:37,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:37,815 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:36:37,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37 WrapperNode [2025-02-06 04:36:37,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:37,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:37,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:36:37,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:36:37,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,833 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-02-06 04:36:37,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:37,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:36:37,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:36:37,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:36:37,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:36:37,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:36:37,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:36:37,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:36:37,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:36:37,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (1/1) ... [2025-02-06 04:36:37,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:37,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:36:37,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:36:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:36:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:36:37,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:36:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:36:37,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:36:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:36:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:36:37,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:36:37,899 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:36:37,952 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:36:37,953 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:36:38,081 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:36:38,081 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:36:38,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:36:38,177 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:36:38,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:38 BoogieIcfgContainer [2025-02-06 04:36:38,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:36:38,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:36:38,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:36:38,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:36:38,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:37" (1/3) ... [2025-02-06 04:36:38,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad51224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:38, skipping insertion in model container [2025-02-06 04:36:38,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:37" (2/3) ... [2025-02-06 04:36:38,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad51224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:38, skipping insertion in model container [2025-02-06 04:36:38,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:38" (3/3) ... [2025-02-06 04:36:38,186 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-02-06 04:36:38,197 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:36:38,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:36:38,198 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:36:38,239 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:36:38,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2025-02-06 04:36:38,291 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-06 04:36:38,292 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:36:38,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 04:36:38,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2025-02-06 04:36:38,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-02-06 04:36:38,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:36:38,316 INFO L333 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;@77a70eb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:36:38,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:36:38,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:36:38,323 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-06 04:36:38,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:36:38,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:38,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:38,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -123945489, now seen corresponding path program 1 times [2025-02-06 04:36:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:38,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887778475] [2025-02-06 04:36:38,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:38,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:36:38,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:36:38,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:38,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887778475] [2025-02-06 04:36:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887778475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:38,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:36:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871836059] [2025-02-06 04:36:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:38,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:38,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:38,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:38,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:38,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-02-06 04:36:38,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:38,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:38,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:38,741 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-02-06 04:36:38,741 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 04:36:38,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1140 event pairs, 12 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2025-02-06 04:36:38,745 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2025-02-06 04:36:38,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2025-02-06 04:36:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-06 04:36:38,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-02-06 04:36:38,756 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2025-02-06 04:36:38,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2025-02-06 04:36:38,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:36:38,761 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2025-02-06 04:36:38,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-02-06 04:36:38,769 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-02-06 04:36:38,769 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2025-02-06 04:36:38,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-02-06 04:36:38,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:38,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:38,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:36:38,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1666846895, now seen corresponding path program 1 times [2025-02-06 04:36:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064068599] [2025-02-06 04:36:38,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:36:38,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:36:38,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:38,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064068599] [2025-02-06 04:36:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064068599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666865903] [2025-02-06 04:36:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:38,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:38,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:38,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:38,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:38,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:38,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:39,089 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2025-02-06 04:36:39,090 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-06 04:36:39,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 415 events. 225/415 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1866 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 322. Up to 182 conditions per place. [2025-02-06 04:36:39,094 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 10 changer transitions 5/69 dead transitions. [2025-02-06 04:36:39,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 69 transitions, 326 flow [2025-02-06 04:36:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-02-06 04:36:39,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-06 04:36:39,098 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 110 transitions. [2025-02-06 04:36:39,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 69 transitions, 326 flow [2025-02-06 04:36:39,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:39,100 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2025-02-06 04:36:39,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-02-06 04:36:39,102 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-02-06 04:36:39,102 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2025-02-06 04:36:39,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:39,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:36:39,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -651606797, now seen corresponding path program 2 times [2025-02-06 04:36:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71174537] [2025-02-06 04:36:39,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:39,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:36:39,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:36:39,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:39,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71174537] [2025-02-06 04:36:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71174537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:39,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795099899] [2025-02-06 04:36:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:39,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:39,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:39,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:39,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:39,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:39,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:39,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:39,336 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-02-06 04:36:39,336 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 04:36:39,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 424 events. 213/424 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1946 event pairs, 12 based on Foata normal form. 12/404 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2025-02-06 04:36:39,341 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 12 changer transitions 4/69 dead transitions. [2025-02-06 04:36:39,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 382 flow [2025-02-06 04:36:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-02-06 04:36:39,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-06 04:36:39,343 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 107 transitions. [2025-02-06 04:36:39,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 382 flow [2025-02-06 04:36:39,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:39,347 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2025-02-06 04:36:39,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-02-06 04:36:39,349 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-02-06 04:36:39,349 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2025-02-06 04:36:39,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:39,349 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-02-06 04:36:39,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:36:39,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1067980211, now seen corresponding path program 1 times [2025-02-06 04:36:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307504609] [2025-02-06 04:36:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:39,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:36:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:36:39,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:39,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307504609] [2025-02-06 04:36:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307504609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842152337] [2025-02-06 04:36:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:39,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:39,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:39,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:39,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:39,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:39,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:39,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:39,575 INFO L124 PetriNetUnfolderBase]: 212/413 cut-off events. [2025-02-06 04:36:39,575 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-02-06 04:36:39,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 413 events. 212/413 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1937 event pairs, 22 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 668. Up to 191 conditions per place. [2025-02-06 04:36:39,579 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2025-02-06 04:36:39,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 482 flow [2025-02-06 04:36:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-02-06 04:36:39,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-02-06 04:36:39,580 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 106 transitions. [2025-02-06 04:36:39,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 482 flow [2025-02-06 04:36:39,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:39,587 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2025-02-06 04:36:39,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-02-06 04:36:39,589 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2025-02-06 04:36:39,589 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2025-02-06 04:36:39,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:39,589 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-02-06 04:36:39,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:36:39,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:39,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash -465607505, now seen corresponding path program 2 times [2025-02-06 04:36:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:39,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507573909] [2025-02-06 04:36:39,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:39,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:36:39,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:36:39,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:39,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507573909] [2025-02-06 04:36:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507573909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494918705] [2025-02-06 04:36:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:39,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:39,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:39,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:39,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:39,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:39,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:39,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:39,775 INFO L124 PetriNetUnfolderBase]: 201/418 cut-off events. [2025-02-06 04:36:39,775 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-02-06 04:36:39,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 418 events. 201/418 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1834 event pairs, 10 based on Foata normal form. 17/401 useless extension candidates. Maximal degree in co-relation 896. Up to 117 conditions per place. [2025-02-06 04:36:39,779 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 12 changer transitions 1/72 dead transitions. [2025-02-06 04:36:39,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 534 flow [2025-02-06 04:36:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-06 04:36:39,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-02-06 04:36:39,780 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 103 transitions. [2025-02-06 04:36:39,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 534 flow [2025-02-06 04:36:39,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 518 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:39,787 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2025-02-06 04:36:39,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-02-06 04:36:39,789 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2025-02-06 04:36:39,790 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2025-02-06 04:36:39,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:39,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:39,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:39,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:36:39,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:39,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1065239863, now seen corresponding path program 1 times [2025-02-06 04:36:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:39,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29055030] [2025-02-06 04:36:39,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:39,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:36:39,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:36:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:39,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29055030] [2025-02-06 04:36:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29055030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:39,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:36:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868851869] [2025-02-06 04:36:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:36:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:36:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:36:40,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-06 04:36:40,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:40,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-06 04:36:40,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:40,154 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2025-02-06 04:36:40,154 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2025-02-06 04:36:40,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2388 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2025-02-06 04:36:40,158 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2025-02-06 04:36:40,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2025-02-06 04:36:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-02-06 04:36:40,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-02-06 04:36:40,160 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2025-02-06 04:36:40,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2025-02-06 04:36:40,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:40,164 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2025-02-06 04:36:40,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-02-06 04:36:40,165 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2025-02-06 04:36:40,165 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2025-02-06 04:36:40,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:40,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:36:40,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:40,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1321531165, now seen corresponding path program 2 times [2025-02-06 04:36:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121352642] [2025-02-06 04:36:40,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:40,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 04:36:40,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-02-06 04:36:40,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121352642] [2025-02-06 04:36:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121352642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357303953] [2025-02-06 04:36:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:40,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:40,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:40,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:40,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-06 04:36:40,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:40,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-06 04:36:40,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:40,389 INFO L124 PetriNetUnfolderBase]: 299/616 cut-off events. [2025-02-06 04:36:40,389 INFO L125 PetriNetUnfolderBase]: For 2110/2158 co-relation queries the response was YES. [2025-02-06 04:36:40,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 616 events. 299/616 cut-off events. For 2110/2158 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2969 event pairs, 32 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 928. Up to 172 conditions per place. [2025-02-06 04:36:40,393 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2025-02-06 04:36:40,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 812 flow [2025-02-06 04:36:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-02-06 04:36:40,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-02-06 04:36:40,394 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 106 transitions. [2025-02-06 04:36:40,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 812 flow [2025-02-06 04:36:40,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 799 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:40,400 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 589 flow [2025-02-06 04:36:40,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-02-06 04:36:40,400 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2025-02-06 04:36:40,400 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 589 flow [2025-02-06 04:36:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:40,401 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] [2025-02-06 04:36:40,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:36:40,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1258490189, now seen corresponding path program 3 times [2025-02-06 04:36:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840629906] [2025-02-06 04:36:40,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:36:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:40,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:36:40,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-02-06 04:36:40,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:36:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:36:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840629906] [2025-02-06 04:36:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840629906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:40,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870568695] [2025-02-06 04:36:40,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:40,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:40,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:40,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:40,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:40,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:40,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:40,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:40,717 INFO L124 PetriNetUnfolderBase]: 419/807 cut-off events. [2025-02-06 04:36:40,717 INFO L125 PetriNetUnfolderBase]: For 3730/3730 co-relation queries the response was YES. [2025-02-06 04:36:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 807 events. 419/807 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3894 event pairs, 31 based on Foata normal form. 19/772 useless extension candidates. Maximal degree in co-relation 2024. Up to 268 conditions per place. [2025-02-06 04:36:40,725 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 67 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2025-02-06 04:36:40,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 1054 flow [2025-02-06 04:36:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:36:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:36:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-02-06 04:36:40,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-02-06 04:36:40,727 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 589 flow. Second operand 7 states and 134 transitions. [2025-02-06 04:36:40,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 1054 flow [2025-02-06 04:36:40,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 1020 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:40,738 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 693 flow [2025-02-06 04:36:40,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-02-06 04:36:40,738 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2025-02-06 04:36:40,738 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 693 flow [2025-02-06 04:36:40,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:40,740 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] [2025-02-06 04:36:40,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:36:40,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:40,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1517696591, now seen corresponding path program 4 times [2025-02-06 04:36:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:40,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507968264] [2025-02-06 04:36:40,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:40,747 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:36:40,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:36:40,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:36:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:40,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:40,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507968264] [2025-02-06 04:36:40,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507968264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:40,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:40,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184349356] [2025-02-06 04:36:40,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:40,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:40,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:40,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:40,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:40,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:40,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:40,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:40,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:41,025 INFO L124 PetriNetUnfolderBase]: 572/1133 cut-off events. [2025-02-06 04:36:41,025 INFO L125 PetriNetUnfolderBase]: For 5997/6044 co-relation queries the response was YES. [2025-02-06 04:36:41,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1133 events. 572/1133 cut-off events. For 5997/6044 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6083 event pairs, 57 based on Foata normal form. 5/1048 useless extension candidates. Maximal degree in co-relation 2768. Up to 405 conditions per place. [2025-02-06 04:36:41,035 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2025-02-06 04:36:41,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 1333 flow [2025-02-06 04:36:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:36:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:36:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-02-06 04:36:41,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-02-06 04:36:41,037 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 693 flow. Second operand 4 states and 87 transitions. [2025-02-06 04:36:41,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 1333 flow [2025-02-06 04:36:41,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 1311 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 04:36:41,050 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 943 flow [2025-02-06 04:36:41,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=943, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-02-06 04:36:41,050 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2025-02-06 04:36:41,050 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 943 flow [2025-02-06 04:36:41,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:41,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:41,051 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] [2025-02-06 04:36:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:36:41,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1088200312, now seen corresponding path program 1 times [2025-02-06 04:36:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367117486] [2025-02-06 04:36:41,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:36:41,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:36:41,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:41,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:36:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367117486] [2025-02-06 04:36:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367117486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439434901] [2025-02-06 04:36:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:41,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:41,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:41,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:41,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 943 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:41,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:41,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:41,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:41,398 INFO L124 PetriNetUnfolderBase]: 840/1613 cut-off events. [2025-02-06 04:36:41,399 INFO L125 PetriNetUnfolderBase]: For 11970/11970 co-relation queries the response was YES. [2025-02-06 04:36:41,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7590 conditions, 1613 events. 840/1613 cut-off events. For 11970/11970 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9207 event pairs, 76 based on Foata normal form. 30/1552 useless extension candidates. Maximal degree in co-relation 4294. Up to 552 conditions per place. [2025-02-06 04:36:41,413 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 97 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2025-02-06 04:36:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1599 flow [2025-02-06 04:36:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-06 04:36:41,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-02-06 04:36:41,415 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 943 flow. Second operand 5 states and 103 transitions. [2025-02-06 04:36:41,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1599 flow [2025-02-06 04:36:41,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 1599 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:41,429 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 1055 flow [2025-02-06 04:36:41,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1055, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2025-02-06 04:36:41,429 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-02-06 04:36:41,429 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 1055 flow [2025-02-06 04:36:41,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:41,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:41,430 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1] [2025-02-06 04:36:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:36:41,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1301337218, now seen corresponding path program 2 times [2025-02-06 04:36:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:41,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209515644] [2025-02-06 04:36:41,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:41,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:41,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:41,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:41,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:36:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209515644] [2025-02-06 04:36:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209515644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306709915] [2025-02-06 04:36:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:41,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:41,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:41,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:41,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:41,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 1055 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:41,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:41,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:41,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:41,800 INFO L124 PetriNetUnfolderBase]: 1339/2615 cut-off events. [2025-02-06 04:36:41,801 INFO L125 PetriNetUnfolderBase]: For 23548/23672 co-relation queries the response was YES. [2025-02-06 04:36:41,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13161 conditions, 2615 events. 1339/2615 cut-off events. For 23548/23672 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17998 event pairs, 248 based on Foata normal form. 28/2513 useless extension candidates. Maximal degree in co-relation 6740. Up to 1023 conditions per place. [2025-02-06 04:36:41,822 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 87 selfloop transitions, 30 changer transitions 0/143 dead transitions. [2025-02-06 04:36:41,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 2125 flow [2025-02-06 04:36:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:36:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:36:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-02-06 04:36:41,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:36:41,824 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 1055 flow. Second operand 4 states and 84 transitions. [2025-02-06 04:36:41,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 2125 flow [2025-02-06 04:36:41,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 2118 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:41,847 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1396 flow [2025-02-06 04:36:41,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1396, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2025-02-06 04:36:41,849 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2025-02-06 04:36:41,849 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1396 flow [2025-02-06 04:36:41,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:41,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:41,849 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:36:41,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:36:41,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:41,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1805401978, now seen corresponding path program 1 times [2025-02-06 04:36:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025366303] [2025-02-06 04:36:41,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:41,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:36:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:41,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:41,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025366303] [2025-02-06 04:36:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025366303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577385212] [2025-02-06 04:36:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:41,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:36:42,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:36:42,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:42,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 04:36:42,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:42,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577385212] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:42,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:42,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-06 04:36:42,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923402639] [2025-02-06 04:36:42,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:42,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:42,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:42,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:42,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:42,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1396 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:42,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:42,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:42,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:42,646 INFO L124 PetriNetUnfolderBase]: 1675/3618 cut-off events. [2025-02-06 04:36:42,646 INFO L125 PetriNetUnfolderBase]: For 39696/39852 co-relation queries the response was YES. [2025-02-06 04:36:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 3618 events. 1675/3618 cut-off events. For 39696/39852 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 27379 event pairs, 332 based on Foata normal form. 24/3543 useless extension candidates. Maximal degree in co-relation 8775. Up to 1633 conditions per place. [2025-02-06 04:36:42,688 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 144 selfloop transitions, 20 changer transitions 1/195 dead transitions. [2025-02-06 04:36:42,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 195 transitions, 3129 flow [2025-02-06 04:36:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-02-06 04:36:42,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625 [2025-02-06 04:36:42,689 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1396 flow. Second operand 5 states and 122 transitions. [2025-02-06 04:36:42,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 195 transitions, 3129 flow [2025-02-06 04:36:42,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 195 transitions, 3129 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:42,767 INFO L231 Difference]: Finished difference. Result has 93 places, 111 transitions, 1505 flow [2025-02-06 04:36:42,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1505, PETRI_PLACES=93, PETRI_TRANSITIONS=111} [2025-02-06 04:36:42,767 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2025-02-06 04:36:42,767 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 1505 flow [2025-02-06 04:36:42,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:42,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:42,768 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:36:42,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:36:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:36:42,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 487767274, now seen corresponding path program 2 times [2025-02-06 04:36:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:42,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205853085] [2025-02-06 04:36:42,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:42,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:42,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:42,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:42,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205853085] [2025-02-06 04:36:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205853085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495498128] [2025-02-06 04:36:43,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:43,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:43,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:43,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:43,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:36:43,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:43,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:43,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:43,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:43,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 04:36:43,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:43,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495498128] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:43,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 04:36:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047783210] [2025-02-06 04:36:43,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:36:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:43,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:36:43,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:36:43,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:43,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 1505 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:43,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:43,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:43,867 INFO L124 PetriNetUnfolderBase]: 1992/4331 cut-off events. [2025-02-06 04:36:43,867 INFO L125 PetriNetUnfolderBase]: For 50382/50674 co-relation queries the response was YES. [2025-02-06 04:36:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25240 conditions, 4331 events. 1992/4331 cut-off events. For 50382/50674 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33924 event pairs, 391 based on Foata normal form. 67/4292 useless extension candidates. Maximal degree in co-relation 10471. Up to 1438 conditions per place. [2025-02-06 04:36:43,900 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 172 selfloop transitions, 28 changer transitions 1/231 dead transitions. [2025-02-06 04:36:43,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 231 transitions, 3796 flow [2025-02-06 04:36:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 04:36:43,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-02-06 04:36:43,902 INFO L175 Difference]: Start difference. First operand has 93 places, 111 transitions, 1505 flow. Second operand 6 states and 145 transitions. [2025-02-06 04:36:43,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 231 transitions, 3796 flow [2025-02-06 04:36:43,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 231 transitions, 3758 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:43,941 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 1600 flow [2025-02-06 04:36:43,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1600, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2025-02-06 04:36:43,942 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2025-02-06 04:36:43,942 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1600 flow [2025-02-06 04:36:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:43,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:43,942 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:36:43,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:36:44,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:44,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -852121092, now seen corresponding path program 3 times [2025-02-06 04:36:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214310426] [2025-02-06 04:36:44,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:36:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:44,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:44,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:44,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:36:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:44,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214310426] [2025-02-06 04:36:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214310426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:44,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375139972] [2025-02-06 04:36:44,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:36:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:44,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:44,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:44,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:36:44,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:44,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:44,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:36:44,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:44,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:36:44,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:44,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375139972] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:44,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 04:36:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491617942] [2025-02-06 04:36:44,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:36:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:44,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:36:44,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:36:44,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:44,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1600 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:44,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:44,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:44,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:45,088 INFO L124 PetriNetUnfolderBase]: 2723/5963 cut-off events. [2025-02-06 04:36:45,088 INFO L125 PetriNetUnfolderBase]: For 71290/71548 co-relation queries the response was YES. [2025-02-06 04:36:45,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35341 conditions, 5963 events. 2723/5963 cut-off events. For 71290/71548 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 49733 event pairs, 463 based on Foata normal form. 43/5858 useless extension candidates. Maximal degree in co-relation 12251. Up to 2661 conditions per place. [2025-02-06 04:36:45,125 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 204 selfloop transitions, 29 changer transitions 1/264 dead transitions. [2025-02-06 04:36:45,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 264 transitions, 4307 flow [2025-02-06 04:36:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-02-06 04:36:45,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-02-06 04:36:45,127 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 1600 flow. Second operand 6 states and 147 transitions. [2025-02-06 04:36:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 264 transitions, 4307 flow [2025-02-06 04:36:45,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 264 transitions, 4241 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:45,176 INFO L231 Difference]: Finished difference. Result has 105 places, 138 transitions, 1772 flow [2025-02-06 04:36:45,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1772, PETRI_PLACES=105, PETRI_TRANSITIONS=138} [2025-02-06 04:36:45,176 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2025-02-06 04:36:45,176 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 138 transitions, 1772 flow [2025-02-06 04:36:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:45,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:45,177 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:36:45,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:36:45,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:45,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:45,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1233407382, now seen corresponding path program 4 times [2025-02-06 04:36:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713828966] [2025-02-06 04:36:45,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:45,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:45,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:45,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:36:45,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713828966] [2025-02-06 04:36:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713828966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575025567] [2025-02-06 04:36:45,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:45,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:45,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:36:45,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:45,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:45,541 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:36:45,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:45,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:36:45,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:45,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575025567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:45,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:45,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 04:36:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103173087] [2025-02-06 04:36:45,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:45,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:36:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:45,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:36:45,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:36:45,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:45,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 138 transitions, 1772 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:45,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:45,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:45,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:46,402 INFO L124 PetriNetUnfolderBase]: 3200/7054 cut-off events. [2025-02-06 04:36:46,402 INFO L125 PetriNetUnfolderBase]: For 85299/85611 co-relation queries the response was YES. [2025-02-06 04:36:46,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42111 conditions, 7054 events. 3200/7054 cut-off events. For 85299/85611 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 60862 event pairs, 537 based on Foata normal form. 91/6982 useless extension candidates. Maximal degree in co-relation 19222. Up to 2695 conditions per place. [2025-02-06 04:36:46,443 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 206 selfloop transitions, 44 changer transitions 1/281 dead transitions. [2025-02-06 04:36:46,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 281 transitions, 4500 flow [2025-02-06 04:36:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-02-06 04:36:46,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-02-06 04:36:46,445 INFO L175 Difference]: Start difference. First operand has 105 places, 138 transitions, 1772 flow. Second operand 6 states and 147 transitions. [2025-02-06 04:36:46,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 281 transitions, 4500 flow [2025-02-06 04:36:46,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 281 transitions, 4478 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:46,507 INFO L231 Difference]: Finished difference. Result has 113 places, 155 transitions, 2039 flow [2025-02-06 04:36:46,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2039, PETRI_PLACES=113, PETRI_TRANSITIONS=155} [2025-02-06 04:36:46,507 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2025-02-06 04:36:46,507 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 2039 flow [2025-02-06 04:36:46,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:46,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:46,508 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:36:46,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:36:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 04:36:46,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -833794648, now seen corresponding path program 5 times [2025-02-06 04:36:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979732856] [2025-02-06 04:36:46,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:36:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:46,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:46,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:46,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:46,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:46,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:46,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979732856] [2025-02-06 04:36:46,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979732856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:46,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018562581] [2025-02-06 04:36:46,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:36:46,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:46,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:46,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:46,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:36:46,851 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:36:46,864 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:36:46,864 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:46,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:36:46,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:46,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018562581] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:46,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 04:36:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016105817] [2025-02-06 04:36:46,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:46,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:36:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:46,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:36:46,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:36:46,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 04:36:46,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 155 transitions, 2039 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:46,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:46,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 04:36:46,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:47,939 INFO L124 PetriNetUnfolderBase]: 3402/7569 cut-off events. [2025-02-06 04:36:47,940 INFO L125 PetriNetUnfolderBase]: For 95769/96103 co-relation queries the response was YES. [2025-02-06 04:36:47,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46503 conditions, 7569 events. 3402/7569 cut-off events. For 95769/96103 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 66524 event pairs, 678 based on Foata normal form. 103/7531 useless extension candidates. Maximal degree in co-relation 22042. Up to 3821 conditions per place. [2025-02-06 04:36:48,010 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 218 selfloop transitions, 33 changer transitions 1/282 dead transitions. [2025-02-06 04:36:48,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 282 transitions, 4518 flow [2025-02-06 04:36:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 04:36:48,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-02-06 04:36:48,012 INFO L175 Difference]: Start difference. First operand has 113 places, 155 transitions, 2039 flow. Second operand 6 states and 145 transitions. [2025-02-06 04:36:48,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 282 transitions, 4518 flow [2025-02-06 04:36:48,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 282 transitions, 4510 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:48,112 INFO L231 Difference]: Finished difference. Result has 121 places, 170 transitions, 2292 flow [2025-02-06 04:36:48,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2292, PETRI_PLACES=121, PETRI_TRANSITIONS=170} [2025-02-06 04:36:48,113 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 89 predicate places. [2025-02-06 04:36:48,113 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 170 transitions, 2292 flow [2025-02-06 04:36:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:48,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:48,113 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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] [2025-02-06 04:36:48,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:36:48,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 04:36:48,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:36:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash 987658096, now seen corresponding path program 6 times [2025-02-06 04:36:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:48,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433428954] [2025-02-06 04:36:48,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:36:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:48,326 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-02-06 04:36:48,354 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:36:48,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:36:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433428954] [2025-02-06 04:36:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433428954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909855355] [2025-02-06 04:36:48,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:36:48,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:48,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:48,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:36:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:36:48,556 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-02-06 04:36:48,602 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:36:48,602 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:36:48,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:48,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:36:48,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:48,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909855355] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:49,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-02-06 04:36:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853292438] [2025-02-06 04:36:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:49,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:36:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:49,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:36:49,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:36:49,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:36:49,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 170 transitions, 2292 flow. Second operand has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:49,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:36:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:52,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:36:57,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:03,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:07,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:19,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:40,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:49,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:37:50,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:38:10,310 INFO L124 PetriNetUnfolderBase]: 19607/39318 cut-off events. [2025-02-06 04:38:10,310 INFO L125 PetriNetUnfolderBase]: For 506351/506351 co-relation queries the response was YES. [2025-02-06 04:38:10,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245241 conditions, 39318 events. 19607/39318 cut-off events. For 506351/506351 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 386674 event pairs, 466 based on Foata normal form. 2006/41323 useless extension candidates. Maximal degree in co-relation 155107. Up to 7179 conditions per place. [2025-02-06 04:38:10,703 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1552 selfloop transitions, 326 changer transitions 1/1892 dead transitions. [2025-02-06 04:38:10,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1892 transitions, 25344 flow [2025-02-06 04:38:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-06 04:38:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-02-06 04:38:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1095 transitions. [2025-02-06 04:38:10,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.600328947368421 [2025-02-06 04:38:10,706 INFO L175 Difference]: Start difference. First operand has 121 places, 170 transitions, 2292 flow. Second operand 57 states and 1095 transitions. [2025-02-06 04:38:10,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1892 transitions, 25344 flow [2025-02-06 04:38:11,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1892 transitions, 24829 flow, removed 231 selfloop flow, removed 1 redundant places. [2025-02-06 04:38:11,370 INFO L231 Difference]: Finished difference. Result has 209 places, 468 transitions, 8900 flow [2025-02-06 04:38:11,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8900, PETRI_PLACES=209, PETRI_TRANSITIONS=468} [2025-02-06 04:38:11,371 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2025-02-06 04:38:11,371 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 468 transitions, 8900 flow [2025-02-06 04:38:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:11,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:11,371 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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] [2025-02-06 04:38:11,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 04:38:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 04:38:11,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:38:11,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -984368916, now seen corresponding path program 7 times [2025-02-06 04:38:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:11,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434355686] [2025-02-06 04:38:11,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:38:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:11,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:38:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:38:11,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434355686] [2025-02-06 04:38:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434355686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983140417] [2025-02-06 04:38:11,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:38:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:11,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:11,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:38:11,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:38:11,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:38:11,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:11,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:38:11,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:12,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983140417] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:38:13,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:38:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-02-06 04:38:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651267919] [2025-02-06 04:38:13,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:38:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:38:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:13,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:38:13,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:38:13,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-06 04:38:13,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 468 transitions, 8900 flow. Second operand has 21 states, 21 states have (on average 14.428571428571429) internal successors, (303), 21 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:13,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:13,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-06 04:38:13,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:16,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 04:38:17,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []