./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.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-5.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 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:36:51,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:36:51,461 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:51,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:36:51,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:36:51,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:36:51,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:36:51,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:36:51,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:36:51,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:36:51,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:36:51,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:36:51,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:36:51,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:36:51,493 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:36:51,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:36:51,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:36:51,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:36:51,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:51,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:36:51,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:36:51,496 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 -> 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f [2025-02-06 04:36:51,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:36:51,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:36:51,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:36:51,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:36:51,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:36:51,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-02-06 04:36:52,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbe3f022/db1907be3e4a48c3a17b71f2347cce87/FLAGf4e0c399b [2025-02-06 04:36:53,220 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:36:53,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-02-06 04:36:53,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbe3f022/db1907be3e4a48c3a17b71f2347cce87/FLAGf4e0c399b [2025-02-06 04:36:53,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbe3f022/db1907be3e4a48c3a17b71f2347cce87 [2025-02-06 04:36:53,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:36:53,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:36:53,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:53,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:36:53,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:36:53,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:53" (1/1) ... [2025-02-06 04:36:53,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c31bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:53, skipping insertion in model container [2025-02-06 04:36:53,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:53" (1/1) ... [2025-02-06 04:36:53,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:36:53,738 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-5.wvr.c[3066,3079] [2025-02-06 04:36:53,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:53,751 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:36:53,766 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-5.wvr.c[3066,3079] [2025-02-06 04:36:53,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:53,783 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:36:53,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:53 WrapperNode [2025-02-06 04:36:53,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:53,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:53,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:36:53,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:36:53,789 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:53" (1/1) ... [2025-02-06 04:36:53,798 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:53" (1/1) ... [2025-02-06 04:36:53,813 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-02-06 04:36:53,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:53,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:36:53,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:36:53,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:36:53,822 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:53" (1/1) ... [2025-02-06 04:36:53,822 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:53" (1/1) ... [2025-02-06 04:36:53,823 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:53" (1/1) ... [2025-02-06 04:36:53,835 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:53,836 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:53" (1/1) ... [2025-02-06 04:36:53,836 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:53" (1/1) ... [2025-02-06 04:36:53,838 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:53" (1/1) ... [2025-02-06 04:36:53,841 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:53" (1/1) ... [2025-02-06 04:36:53,842 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:53" (1/1) ... [2025-02-06 04:36:53,843 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:53" (1/1) ... [2025-02-06 04:36:53,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:36:53,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:36:53,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:36:53,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:36:53,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:53" (1/1) ... [2025-02-06 04:36:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:53,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:53,871 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:53,873 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:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:36:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:36:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:36:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:36:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:36:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:36:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:36:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:36:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:36:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:36:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:36:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:36:53,892 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:53,964 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:36:53,966 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:36:54,137 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:36:54,137 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:36:54,282 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:36:54,282 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:36:54,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:54 BoogieIcfgContainer [2025-02-06 04:36:54,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:36:54,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:36:54,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:36:54,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:36:54,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:53" (1/3) ... [2025-02-06 04:36:54,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e85326a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:54, skipping insertion in model container [2025-02-06 04:36:54,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:53" (2/3) ... [2025-02-06 04:36:54,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e85326a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:54, skipping insertion in model container [2025-02-06 04:36:54,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:54" (3/3) ... [2025-02-06 04:36:54,290 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-02-06 04:36:54,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:36:54,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-5.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:36:54,301 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:36:54,346 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:36:54,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-02-06 04:36:54,402 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-02-06 04:36:54,403 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:36:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-02-06 04:36:54,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-02-06 04:36:54,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-02-06 04:36:54,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:36:54,418 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;@1775461a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:36:54,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:36:54,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:36:54,428 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-02-06 04:36:54,429 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:36:54,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:54,429 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:54,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1535137678, now seen corresponding path program 1 times [2025-02-06 04:36:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750184298] [2025-02-06 04:36:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:36:54,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:36:54,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:54,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:54,905 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:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750184298] [2025-02-06 04:36:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750184298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429092266] [2025-02-06 04:36:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:54,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:54,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:54,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:54,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:54,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:54,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:55,404 INFO L124 PetriNetUnfolderBase]: 2110/3011 cut-off events. [2025-02-06 04:36:55,405 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-06 04:36:55,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 3011 events. 2110/3011 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13785 event pairs, 78 based on Foata normal form. 0/2583 useless extension candidates. Maximal degree in co-relation 6118. Up to 1069 conditions per place. [2025-02-06 04:36:55,426 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 80 selfloop transitions, 8 changer transitions 6/98 dead transitions. [2025-02-06 04:36:55,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 98 transitions, 417 flow [2025-02-06 04:36:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-02-06 04:36:55,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-02-06 04:36:55,440 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 6 states and 138 transitions. [2025-02-06 04:36:55,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 98 transitions, 417 flow [2025-02-06 04:36:55,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 98 transitions, 395 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:36:55,449 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 120 flow [2025-02-06 04:36:55,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-02-06 04:36:55,454 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-02-06 04:36:55,454 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 120 flow [2025-02-06 04:36:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:55,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:55,454 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:55,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:36:55,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:55,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 328041023, now seen corresponding path program 1 times [2025-02-06 04:36:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:55,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490986282] [2025-02-06 04:36:55,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:55,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:36:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:36:55,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:55,549 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:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490986282] [2025-02-06 04:36:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490986282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:55,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:55,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:36:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510415325] [2025-02-06 04:36:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:55,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:55,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:55,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:55,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:55,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:55,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:55,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:55,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:55,757 INFO L124 PetriNetUnfolderBase]: 1991/2917 cut-off events. [2025-02-06 04:36:55,757 INFO L125 PetriNetUnfolderBase]: For 812/812 co-relation queries the response was YES. [2025-02-06 04:36:55,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6823 conditions, 2917 events. 1991/2917 cut-off events. For 812/812 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12973 event pairs, 680 based on Foata normal form. 78/2562 useless extension candidates. Maximal degree in co-relation 5827. Up to 1656 conditions per place. [2025-02-06 04:36:55,768 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 55 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-02-06 04:36:55,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 304 flow [2025-02-06 04:36:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-06 04:36:55,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2025-02-06 04:36:55,769 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 120 flow. Second operand 3 states and 73 transitions. [2025-02-06 04:36:55,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 304 flow [2025-02-06 04:36:55,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:55,771 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 134 flow [2025-02-06 04:36:55,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-02-06 04:36:55,771 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-02-06 04:36:55,771 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 134 flow [2025-02-06 04:36:55,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:55,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:55,771 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:55,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:36:55,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:55,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1665695656, now seen corresponding path program 1 times [2025-02-06 04:36:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:55,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307931955] [2025-02-06 04:36:55,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:36:55,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:36:55,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:55,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:55,824 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:55,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307931955] [2025-02-06 04:36:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307931955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:36:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106441539] [2025-02-06 04:36:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:55,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:55,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:55,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:55,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:55,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:55,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:55,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:56,094 INFO L124 PetriNetUnfolderBase]: 2882/4242 cut-off events. [2025-02-06 04:36:56,094 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2025-02-06 04:36:56,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 4242 events. 2882/4242 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19802 event pairs, 1041 based on Foata normal form. 86/3643 useless extension candidates. Maximal degree in co-relation 9148. Up to 2663 conditions per place. [2025-02-06 04:36:56,114 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 55 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-02-06 04:36:56,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 326 flow [2025-02-06 04:36:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-06 04:36:56,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2025-02-06 04:36:56,116 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 134 flow. Second operand 3 states and 71 transitions. [2025-02-06 04:36:56,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 326 flow [2025-02-06 04:36:56,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:56,118 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2025-02-06 04:36:56,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-06 04:36:56,119 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-02-06 04:36:56,119 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2025-02-06 04:36:56,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:56,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:56,119 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] [2025-02-06 04:36:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:36:56,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1049735828, now seen corresponding path program 1 times [2025-02-06 04:36:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006776523] [2025-02-06 04:36:56,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:56,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:36:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:36:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:56,323 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:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006776523] [2025-02-06 04:36:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006776523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:36:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912483375] [2025-02-06 04:36:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:56,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:56,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:56,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:56,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:56,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:56,620 INFO L124 PetriNetUnfolderBase]: 2591/3808 cut-off events. [2025-02-06 04:36:56,620 INFO L125 PetriNetUnfolderBase]: For 1783/1783 co-relation queries the response was YES. [2025-02-06 04:36:56,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 3808 events. 2591/3808 cut-off events. For 1783/1783 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16767 event pairs, 175 based on Foata normal form. 0/3291 useless extension candidates. Maximal degree in co-relation 8420. Up to 1972 conditions per place. [2025-02-06 04:36:56,638 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 60 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-02-06 04:36:56,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 377 flow [2025-02-06 04:36:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:36:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:36:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-06 04:36:56,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-02-06 04:36:56,640 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 83 transitions. [2025-02-06 04:36:56,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 377 flow [2025-02-06 04:36:56,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:56,643 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 173 flow [2025-02-06 04:36:56,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-06 04:36:56,644 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-02-06 04:36:56,644 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 173 flow [2025-02-06 04:36:56,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:56,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:56,644 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] [2025-02-06 04:36:56,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:36:56,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:56,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1528410636, now seen corresponding path program 2 times [2025-02-06 04:36:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086444453] [2025-02-06 04:36:56,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:56,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:36:56,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-06 04:36:56,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:56,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:56,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086444453] [2025-02-06 04:36:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086444453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424079242] [2025-02-06 04:36:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:56,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:56,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:56,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:56,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:56,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:56,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:56,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:56,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:56,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:57,073 INFO L124 PetriNetUnfolderBase]: 3347/4898 cut-off events. [2025-02-06 04:36:57,075 INFO L125 PetriNetUnfolderBase]: For 2738/2738 co-relation queries the response was YES. [2025-02-06 04:36:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12627 conditions, 4898 events. 3347/4898 cut-off events. For 2738/2738 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23242 event pairs, 277 based on Foata normal form. 72/4404 useless extension candidates. Maximal degree in co-relation 11493. Up to 2034 conditions per place. [2025-02-06 04:36:57,098 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 77 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-02-06 04:36:57,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 489 flow [2025-02-06 04:36:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-02-06 04:36:57,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 04:36:57,100 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 173 flow. Second operand 5 states and 108 transitions. [2025-02-06 04:36:57,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 489 flow [2025-02-06 04:36:57,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:57,107 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 192 flow [2025-02-06 04:36:57,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-02-06 04:36:57,108 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-02-06 04:36:57,109 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 192 flow [2025-02-06 04:36:57,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:57,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:57,110 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] [2025-02-06 04:36:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:36:57,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash -774996112, now seen corresponding path program 3 times [2025-02-06 04:36:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398823410] [2025-02-06 04:36:57,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:36:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:57,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:36:57,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-02-06 04:36:57,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:36:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:57,228 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:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:57,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398823410] [2025-02-06 04:36:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398823410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:57,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465713698] [2025-02-06 04:36:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:57,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:57,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:57,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:57,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:57,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:57,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:57,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:57,568 INFO L124 PetriNetUnfolderBase]: 4741/6918 cut-off events. [2025-02-06 04:36:57,568 INFO L125 PetriNetUnfolderBase]: For 5009/5009 co-relation queries the response was YES. [2025-02-06 04:36:57,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17979 conditions, 6918 events. 4741/6918 cut-off events. For 5009/5009 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34172 event pairs, 965 based on Foata normal form. 134/6239 useless extension candidates. Maximal degree in co-relation 13971. Up to 2689 conditions per place. [2025-02-06 04:36:57,594 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 80 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-02-06 04:36:57,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 533 flow [2025-02-06 04:36:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-02-06 04:36:57,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-02-06 04:36:57,595 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 192 flow. Second operand 5 states and 107 transitions. [2025-02-06 04:36:57,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 533 flow [2025-02-06 04:36:57,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 519 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:36:57,602 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 202 flow [2025-02-06 04:36:57,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-02-06 04:36:57,603 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-02-06 04:36:57,603 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 202 flow [2025-02-06 04:36:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:57,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:57,604 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] [2025-02-06 04:36:57,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:36:57,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:57,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1457818934, now seen corresponding path program 4 times [2025-02-06 04:36:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897040308] [2025-02-06 04:36:57,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:57,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:36:57,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:36:57,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:36:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897040308] [2025-02-06 04:36:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897040308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106427395] [2025-02-06 04:36:57,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:57,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:57,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:57,763 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:57,764 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:57,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:36:57,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:36:57,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:36:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:57,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:36:57,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:57,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106427395] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:58,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2025-02-06 04:36:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655380772] [2025-02-06 04:36:58,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:58,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:36:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:58,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:36:58,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:36:58,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:36:58,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 202 flow. Second operand has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:58,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:58,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:36:58,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:59,701 INFO L124 PetriNetUnfolderBase]: 18006/26137 cut-off events. [2025-02-06 04:36:59,701 INFO L125 PetriNetUnfolderBase]: For 18594/18594 co-relation queries the response was YES. [2025-02-06 04:36:59,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68729 conditions, 26137 events. 18006/26137 cut-off events. For 18594/18594 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 157339 event pairs, 1846 based on Foata normal form. 368/23531 useless extension candidates. Maximal degree in co-relation 55866. Up to 6016 conditions per place. [2025-02-06 04:36:59,777 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 254 selfloop transitions, 54 changer transitions 36/348 dead transitions. [2025-02-06 04:36:59,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 348 transitions, 2033 flow [2025-02-06 04:36:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 04:36:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 04:36:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 433 transitions. [2025-02-06 04:36:59,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013888888888889 [2025-02-06 04:36:59,780 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 202 flow. Second operand 20 states and 433 transitions. [2025-02-06 04:36:59,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 348 transitions, 2033 flow [2025-02-06 04:36:59,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 1992 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:36:59,790 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 751 flow [2025-02-06 04:36:59,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=751, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2025-02-06 04:36:59,792 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-02-06 04:36:59,792 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 751 flow [2025-02-06 04:36:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:59,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:59,793 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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:36:59,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:36:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:59,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:59,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash 975580039, now seen corresponding path program 5 times [2025-02-06 04:36:59,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:59,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942367411] [2025-02-06 04:36:59,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:36:59,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:00,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-02-06 04:37:00,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:37:00,017 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:37:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:37:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942367411] [2025-02-06 04:37:00,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942367411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865515612] [2025-02-06 04:37:00,085 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:37:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:00,090 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:37:00,091 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:37:00,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-02-06 04:37:00,139 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:37:00,139 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:37:00,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:00,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:37:00,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:00,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:37:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865515612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:00,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-02-06 04:37:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823421606] [2025-02-06 04:37:00,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:00,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:00,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:00,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:37:00,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:37:00,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 751 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:37:00,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:00,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:37:00,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:02,119 INFO L124 PetriNetUnfolderBase]: 18022/26484 cut-off events. [2025-02-06 04:37:02,119 INFO L125 PetriNetUnfolderBase]: For 69158/69158 co-relation queries the response was YES. [2025-02-06 04:37:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91755 conditions, 26484 events. 18022/26484 cut-off events. For 69158/69158 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 158891 event pairs, 7260 based on Foata normal form. 270/23825 useless extension candidates. Maximal degree in co-relation 78164. Up to 11002 conditions per place. [2025-02-06 04:37:02,327 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 186 selfloop transitions, 20 changer transitions 1/211 dead transitions. [2025-02-06 04:37:02,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 211 transitions, 2057 flow [2025-02-06 04:37:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:37:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:37:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-06 04:37:02,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-02-06 04:37:02,332 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 751 flow. Second operand 4 states and 106 transitions. [2025-02-06 04:37:02,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 211 transitions, 2057 flow [2025-02-06 04:37:02,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 211 transitions, 1790 flow, removed 113 selfloop flow, removed 5 redundant places. [2025-02-06 04:37:02,609 INFO L231 Difference]: Finished difference. Result has 87 places, 109 transitions, 862 flow [2025-02-06 04:37:02,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=862, PETRI_PLACES=87, PETRI_TRANSITIONS=109} [2025-02-06 04:37:02,611 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-02-06 04:37:02,611 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 109 transitions, 862 flow [2025-02-06 04:37:02,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:37:02,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:02,611 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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:37:02,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:37:02,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:02,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:37:02,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash -237066312, now seen corresponding path program 1 times [2025-02-06 04:37:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114449259] [2025-02-06 04:37:02,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:02,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:37:02,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:37:02,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:02,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:37:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:02,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114449259] [2025-02-06 04:37:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114449259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:02,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091000701] [2025-02-06 04:37:02,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:02,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:02,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:02,879 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:37:02,881 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:37:02,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:37:02,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:37:02,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:02,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:02,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:37:02,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:02,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:37:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091000701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:02,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-02-06 04:37:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427177267] [2025-02-06 04:37:02,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:02,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:02,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:37:02,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:37:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 109 transitions, 862 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:37:02,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:02,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:37:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:06,745 INFO L124 PetriNetUnfolderBase]: 38627/56825 cut-off events. [2025-02-06 04:37:06,745 INFO L125 PetriNetUnfolderBase]: For 145862/145862 co-relation queries the response was YES. [2025-02-06 04:37:07,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193003 conditions, 56825 events. 38627/56825 cut-off events. For 145862/145862 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 376931 event pairs, 18100 based on Foata normal form. 848/51416 useless extension candidates. Maximal degree in co-relation 179974. Up to 21334 conditions per place. [2025-02-06 04:37:07,208 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 212 selfloop transitions, 32 changer transitions 1/249 dead transitions. [2025-02-06 04:37:07,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 249 transitions, 2489 flow [2025-02-06 04:37:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:37:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:37:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-02-06 04:37:07,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-02-06 04:37:07,209 INFO L175 Difference]: Start difference. First operand has 87 places, 109 transitions, 862 flow. Second operand 4 states and 102 transitions. [2025-02-06 04:37:07,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 249 transitions, 2489 flow [2025-02-06 04:37:07,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 249 transitions, 2421 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-02-06 04:37:07,438 INFO L231 Difference]: Finished difference. Result has 92 places, 134 transitions, 1238 flow [2025-02-06 04:37:07,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1238, PETRI_PLACES=92, PETRI_TRANSITIONS=134} [2025-02-06 04:37:07,439 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-02-06 04:37:07,439 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 134 transitions, 1238 flow [2025-02-06 04:37:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:37:07,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:07,440 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:07,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:37:07,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:07,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:37:07,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1997095414, now seen corresponding path program 6 times [2025-02-06 04:37:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226659263] [2025-02-06 04:37:07,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:37:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:07,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 3 equivalence classes. [2025-02-06 04:37:07,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:37:07,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:37:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226659263] [2025-02-06 04:37:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226659263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779804417] [2025-02-06 04:37:07,882 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:37:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:07,887 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:37:07,888 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:37:07,928 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 3 equivalence classes. [2025-02-06 04:37:07,948 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:37:07,948 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:37:07,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:07,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:37:07,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:08,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779804417] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:08,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 16 [2025-02-06 04:37:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377481017] [2025-02-06 04:37:08,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:37:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:08,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:37:08,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:37:08,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:37:08,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 134 transitions, 1238 flow. Second operand has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:08,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:08,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:37:08,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:19,704 INFO L124 PetriNetUnfolderBase]: 105752/153601 cut-off events. [2025-02-06 04:37:19,704 INFO L125 PetriNetUnfolderBase]: For 475170/475170 co-relation queries the response was YES. [2025-02-06 04:37:20,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531547 conditions, 153601 events. 105752/153601 cut-off events. For 475170/475170 co-relation queries the response was YES. Maximal size of possible extension queue 3594. Compared 1098342 event pairs, 14024 based on Foata normal form. 3548/139869 useless extension candidates. Maximal degree in co-relation 492374. Up to 34568 conditions per place. [2025-02-06 04:37:20,827 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 341 selfloop transitions, 213 changer transitions 198/756 dead transitions. [2025-02-06 04:37:20,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 756 transitions, 7563 flow [2025-02-06 04:37:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:37:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:37:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 526 transitions. [2025-02-06 04:37:20,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6087962962962963 [2025-02-06 04:37:20,829 INFO L175 Difference]: Start difference. First operand has 92 places, 134 transitions, 1238 flow. Second operand 24 states and 526 transitions. [2025-02-06 04:37:20,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 756 transitions, 7563 flow [2025-02-06 04:37:22,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 756 transitions, 7353 flow, removed 105 selfloop flow, removed 0 redundant places. [2025-02-06 04:37:22,008 INFO L231 Difference]: Finished difference. Result has 128 places, 265 transitions, 3514 flow [2025-02-06 04:37:22,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3514, PETRI_PLACES=128, PETRI_TRANSITIONS=265} [2025-02-06 04:37:22,009 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-02-06 04:37:22,009 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 265 transitions, 3514 flow [2025-02-06 04:37:22,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:22,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:22,010 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:22,015 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:37:22,210 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,SelfDestructingSolverStorable9 [2025-02-06 04:37:22,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:37:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1903065143, now seen corresponding path program 7 times [2025-02-06 04:37:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402460243] [2025-02-06 04:37:22,212 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:37:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:22,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 04:37:22,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:37:22,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:22,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:37:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402460243] [2025-02-06 04:37:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402460243] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793076736] [2025-02-06 04:37:22,319 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:37:22,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:22,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:22,324 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:37:22,325 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:37:22,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 04:37:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:37:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:22,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:22,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:37:22,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:22,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:37:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793076736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:22,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-02-06 04:37:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932269099] [2025-02-06 04:37:22,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:37:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:22,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:37:22,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:37:22,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 04:37:22,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 265 transitions, 3514 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:22,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:22,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 04:37:22,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand