./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 02:21:18,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:21:18,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:21:18,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:21:18,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:21:18,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:21:18,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:21:18,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:21:18,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:21:18,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:21:18,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:21:18,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:21:18,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:21:18,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:21:18,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:21:18,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:21:18,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:21:18,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:21:18,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:21:18,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:21:18,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:21:18,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:21:18,982 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/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-03-04 02:21:19,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:21:19,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:21:19,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:21:19,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:21:19,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:21:19,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-03-04 02:21:20,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed65fb1f/4c2dee5cdcaf483d9338171f1fdd7f5c/FLAGf52d015de [2025-03-04 02:21:20,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:21:20,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-03-04 02:21:20,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed65fb1f/4c2dee5cdcaf483d9338171f1fdd7f5c/FLAGf52d015de [2025-03-04 02:21:20,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed65fb1f/4c2dee5cdcaf483d9338171f1fdd7f5c [2025-03-04 02:21:20,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:21:20,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:21:20,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:21:20,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:21:20,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:21:20,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:21:20" (1/1) ... [2025-03-04 02:21:20,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c8be21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:20, skipping insertion in model container [2025-03-04 02:21:20,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:21:20" (1/1) ... [2025-03-04 02:21:20,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:21:21,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3066,3079] [2025-03-04 02:21:21,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:21:21,038 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:21:21,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3066,3079] [2025-03-04 02:21:21,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:21:21,068 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:21:21,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21 WrapperNode [2025-03-04 02:21:21,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:21:21,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:21:21,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:21:21,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:21:21,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,099 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-04 02:21:21,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:21:21,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:21:21,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:21:21,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:21:21,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,122 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-03-04 02:21:21,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:21:21,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:21:21,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:21:21,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:21:21,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (1/1) ... [2025-03-04 02:21:21,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:21:21,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:21,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:21:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:21:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:21:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:21:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:21:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:21:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:21:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:21:21,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:21:21,188 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:21:21,252 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:21:21,253 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:21:21,411 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:21:21,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:21:21,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:21:21,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:21:21,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:21:21 BoogieIcfgContainer [2025-03-04 02:21:21,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:21:21,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:21:21,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:21:21,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:21:21,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:21:20" (1/3) ... [2025-03-04 02:21:21,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:21:21, skipping insertion in model container [2025-03-04 02:21:21,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:21:21" (2/3) ... [2025-03-04 02:21:21,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:21:21, skipping insertion in model container [2025-03-04 02:21:21,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:21:21" (3/3) ... [2025-03-04 02:21:21,542 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-03-04 02:21:21,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:21:21,554 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-03-04 02:21:21,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:21:21,594 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:21:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-03-04 02:21:21,638 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-04 02:21:21,642 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:21:21,644 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-03-04 02:21:21,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-03-04 02:21:21,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-03-04 02:21:21,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:21:21,665 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;@2b171783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:21:21,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:21:21,677 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:21:21,677 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-03-04 02:21:21,677 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:21:21,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:21,678 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-03-04 02:21:21,678 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-03-04 02:21:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1535137678, now seen corresponding path program 1 times [2025-03-04 02:21:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847106879] [2025-03-04 02:21:21,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:21,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:21:21,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:21:21,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:21,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847106879] [2025-03-04 02:21:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847106879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:21:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330575607] [2025-03-04 02:21:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:22,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:21:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:21:22,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:21:22,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:22,158 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-03-04 02:21:22,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:22,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:22,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:22,576 INFO L124 PetriNetUnfolderBase]: 2110/3011 cut-off events. [2025-03-04 02:21:22,576 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-04 02:21:22,582 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-03-04 02:21:22,593 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 80 selfloop transitions, 8 changer transitions 6/98 dead transitions. [2025-03-04 02:21:22,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 98 transitions, 417 flow [2025-03-04 02:21:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:21:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:21:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-04 02:21:22,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 02:21:22,609 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 6 states and 138 transitions. [2025-03-04 02:21:22,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 98 transitions, 417 flow [2025-03-04 02:21:22,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 98 transitions, 395 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:21:22,618 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 120 flow [2025-03-04 02:21:22,620 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-03-04 02:21:22,622 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-03-04 02:21:22,623 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 120 flow [2025-03-04 02:21:22,624 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-03-04 02:21:22,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:22,625 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-03-04 02:21:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:21:22,625 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-03-04 02:21:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 328041023, now seen corresponding path program 1 times [2025-03-04 02:21:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830111328] [2025-03-04 02:21:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:22,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:21:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:21:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830111328] [2025-03-04 02:21:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830111328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:21:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313220332] [2025-03-04 02:21:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:22,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:21:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:21:22,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:21:22,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:22,716 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-03-04 02:21:22,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:22,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:22,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:22,907 INFO L124 PetriNetUnfolderBase]: 1991/2917 cut-off events. [2025-03-04 02:21:22,907 INFO L125 PetriNetUnfolderBase]: For 812/812 co-relation queries the response was YES. [2025-03-04 02:21:22,910 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-03-04 02:21:22,918 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 55 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-03-04 02:21:22,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 304 flow [2025-03-04 02:21:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:21:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:21:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 02:21:22,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2025-03-04 02:21:22,919 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 120 flow. Second operand 3 states and 73 transitions. [2025-03-04 02:21:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 304 flow [2025-03-04 02:21:22,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:21:22,921 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 134 flow [2025-03-04 02:21:22,922 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-03-04 02:21:22,922 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-04 02:21:22,922 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 134 flow [2025-03-04 02:21:22,922 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-03-04 02:21:22,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:22,922 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-03-04 02:21:22,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:21:22,922 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-03-04 02:21:22,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:22,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1665695656, now seen corresponding path program 1 times [2025-03-04 02:21:22,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:22,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715392910] [2025-03-04 02:21:22,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:21:22,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:21:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715392910] [2025-03-04 02:21:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715392910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:22,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:22,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:21:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860082087] [2025-03-04 02:21:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:21:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:22,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:21:22,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:21:22,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:22,988 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-03-04 02:21:22,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:22,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:23,255 INFO L124 PetriNetUnfolderBase]: 2882/4242 cut-off events. [2025-03-04 02:21:23,256 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2025-03-04 02:21:23,262 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-03-04 02:21:23,277 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 55 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-03-04 02:21:23,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 326 flow [2025-03-04 02:21:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:21:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:21:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 02:21:23,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2025-03-04 02:21:23,280 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 134 flow. Second operand 3 states and 71 transitions. [2025-03-04 02:21:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 326 flow [2025-03-04 02:21:23,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:21:23,285 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2025-03-04 02:21:23,285 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-03-04 02:21:23,286 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-04 02:21:23,286 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2025-03-04 02:21:23,287 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-03-04 02:21:23,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:23,287 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-03-04 02:21:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:21:23,287 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-03-04 02:21:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1049735828, now seen corresponding path program 1 times [2025-03-04 02:21:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344808863] [2025-03-04 02:21:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:21:23,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:23,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:23,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344808863] [2025-03-04 02:21:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344808863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:23,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:21:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762426533] [2025-03-04 02:21:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:23,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:21:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:23,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:21:23,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:21:23,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:23,438 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-03-04 02:21:23,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:23,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:23,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:23,670 INFO L124 PetriNetUnfolderBase]: 2591/3808 cut-off events. [2025-03-04 02:21:23,670 INFO L125 PetriNetUnfolderBase]: For 1783/1783 co-relation queries the response was YES. [2025-03-04 02:21:23,675 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-03-04 02:21:23,686 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 60 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-03-04 02:21:23,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 377 flow [2025-03-04 02:21:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:21:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:21:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 02:21:23,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-04 02:21:23,687 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 83 transitions. [2025-03-04 02:21:23,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 377 flow [2025-03-04 02:21:23,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:21:23,692 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 173 flow [2025-03-04 02:21:23,692 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-03-04 02:21:23,693 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-04 02:21:23,693 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 173 flow [2025-03-04 02:21:23,693 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-03-04 02:21:23,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:23,693 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-03-04 02:21:23,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:21:23,694 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-03-04 02:21:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1528410636, now seen corresponding path program 2 times [2025-03-04 02:21:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:23,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321499910] [2025-03-04 02:21:23,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:21:23,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:23,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:23,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 02:21:23,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:21:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321499910] [2025-03-04 02:21:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321499910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:21:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304496890] [2025-03-04 02:21:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:21:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:23,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:21:23,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:21:23,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:23,817 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-03-04 02:21:23,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:23,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:23,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:24,112 INFO L124 PetriNetUnfolderBase]: 3347/4898 cut-off events. [2025-03-04 02:21:24,113 INFO L125 PetriNetUnfolderBase]: For 2738/2738 co-relation queries the response was YES. [2025-03-04 02:21:24,118 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-03-04 02:21:24,132 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 77 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-03-04 02:21:24,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 489 flow [2025-03-04 02:21:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:21:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:21:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-04 02:21:24,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:21:24,133 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 173 flow. Second operand 5 states and 108 transitions. [2025-03-04 02:21:24,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 489 flow [2025-03-04 02:21:24,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:21:24,137 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 192 flow [2025-03-04 02:21:24,138 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-03-04 02:21:24,138 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-04 02:21:24,138 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 192 flow [2025-03-04 02:21:24,138 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-03-04 02:21:24,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:24,138 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-03-04 02:21:24,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:21:24,138 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-03-04 02:21:24,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash -774996112, now seen corresponding path program 3 times [2025-03-04 02:21:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651901087] [2025-03-04 02:21:24,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:21:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:24,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:24,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 02:21:24,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:21:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651901087] [2025-03-04 02:21:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651901087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:21:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129839830] [2025-03-04 02:21:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:21:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:24,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:21:24,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:21:24,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:24,236 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-03-04 02:21:24,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:24,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:24,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:24,590 INFO L124 PetriNetUnfolderBase]: 4741/6918 cut-off events. [2025-03-04 02:21:24,590 INFO L125 PetriNetUnfolderBase]: For 5009/5009 co-relation queries the response was YES. [2025-03-04 02:21:24,598 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-03-04 02:21:24,615 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 80 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-03-04 02:21:24,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 533 flow [2025-03-04 02:21:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:21:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:21:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 02:21:24,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-03-04 02:21:24,616 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 192 flow. Second operand 5 states and 107 transitions. [2025-03-04 02:21:24,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 533 flow [2025-03-04 02:21:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 519 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:21:24,623 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 202 flow [2025-03-04 02:21:24,623 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-03-04 02:21:24,623 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-03-04 02:21:24,623 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 202 flow [2025-03-04 02:21:24,623 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-03-04 02:21:24,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:24,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:24,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:21:24,623 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-03-04 02:21:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1457818934, now seen corresponding path program 4 times [2025-03-04 02:21:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345059000] [2025-03-04 02:21:24,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:24,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:24,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:24,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:24,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:24,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345059000] [2025-03-04 02:21:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345059000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896621978] [2025-03-04 02:21:24,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:24,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:24,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:24,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:24,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:21:24,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:24,870 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:24,871 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:24,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:21:24,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:24,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896621978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:25,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2025-03-04 02:21:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103374217] [2025-03-04 02:21:25,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:21:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:25,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:21:25,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:21:25,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:25,159 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-03-04 02:21:25,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:25,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:25,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:26,729 INFO L124 PetriNetUnfolderBase]: 18006/26137 cut-off events. [2025-03-04 02:21:26,730 INFO L125 PetriNetUnfolderBase]: For 18594/18594 co-relation queries the response was YES. [2025-03-04 02:21:26,777 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-03-04 02:21:26,818 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 254 selfloop transitions, 54 changer transitions 36/348 dead transitions. [2025-03-04 02:21:26,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 348 transitions, 2033 flow [2025-03-04 02:21:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:21:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:21:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 433 transitions. [2025-03-04 02:21:26,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013888888888889 [2025-03-04 02:21:26,820 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 202 flow. Second operand 20 states and 433 transitions. [2025-03-04 02:21:26,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 348 transitions, 2033 flow [2025-03-04 02:21:26,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 1992 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:21:26,832 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 751 flow [2025-03-04 02:21:26,832 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-03-04 02:21:26,833 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-03-04 02:21:26,833 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 751 flow [2025-03-04 02:21:26,833 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-03-04 02:21:26,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:26,834 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-03-04 02:21:26,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:27,035 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-03-04 02:21:27,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 975580039, now seen corresponding path program 5 times [2025-03-04 02:21:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:27,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742671421] [2025-03-04 02:21:27,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:27,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-03-04 02:21:27,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:21:27,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:21:27,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742671421] [2025-03-04 02:21:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742671421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167160648] [2025-03-04 02:21:27,104 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:27,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:27,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:21:27,145 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-03-04 02:21:27,162 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:21:27,163 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:21:27,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:27,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:21:27,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:27,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167160648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:27,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:27,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-03-04 02:21:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766783226] [2025-03-04 02:21:27,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:27,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:21:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:27,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:21:27,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:21:27,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:27,224 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-03-04 02:21:27,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:27,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:27,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:28,993 INFO L124 PetriNetUnfolderBase]: 18022/26484 cut-off events. [2025-03-04 02:21:28,993 INFO L125 PetriNetUnfolderBase]: For 69158/69158 co-relation queries the response was YES. [2025-03-04 02:21:29,061 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-03-04 02:21:29,136 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 186 selfloop transitions, 20 changer transitions 1/211 dead transitions. [2025-03-04 02:21:29,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 211 transitions, 2057 flow [2025-03-04 02:21:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:21:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:21:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 02:21:29,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-03-04 02:21:29,137 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 751 flow. Second operand 4 states and 106 transitions. [2025-03-04 02:21:29,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 211 transitions, 2057 flow [2025-03-04 02:21:29,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 211 transitions, 1790 flow, removed 113 selfloop flow, removed 5 redundant places. [2025-03-04 02:21:29,429 INFO L231 Difference]: Finished difference. Result has 87 places, 109 transitions, 862 flow [2025-03-04 02:21:29,430 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-03-04 02:21:29,430 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-03-04 02:21:29,430 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 109 transitions, 862 flow [2025-03-04 02:21:29,430 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-03-04 02:21:29,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:29,430 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-03-04 02:21:29,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:21:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:21:29,631 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-03-04 02:21:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -237066312, now seen corresponding path program 1 times [2025-03-04 02:21:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424226476] [2025-03-04 02:21:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:29,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:21:29,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:21:29,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:29,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:29,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424226476] [2025-03-04 02:21:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424226476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746739438] [2025-03-04 02:21:29,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:21:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:29,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:29,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:21:29,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:21:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:21:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:29,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:21:29,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:21:29,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746739438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:29,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:29,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-03-04 02:21:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056985032] [2025-03-04 02:21:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:21:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:29,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:21:29,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:21:29,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:29,809 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-03-04 02:21:29,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:29,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:29,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:33,467 INFO L124 PetriNetUnfolderBase]: 38627/56825 cut-off events. [2025-03-04 02:21:33,467 INFO L125 PetriNetUnfolderBase]: For 145862/145862 co-relation queries the response was YES. [2025-03-04 02:21:33,629 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-03-04 02:21:33,778 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 212 selfloop transitions, 32 changer transitions 1/249 dead transitions. [2025-03-04 02:21:33,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 249 transitions, 2489 flow [2025-03-04 02:21:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:21:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:21:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-04 02:21:33,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 02:21:33,779 INFO L175 Difference]: Start difference. First operand has 87 places, 109 transitions, 862 flow. Second operand 4 states and 102 transitions. [2025-03-04 02:21:33,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 249 transitions, 2489 flow [2025-03-04 02:21:34,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 249 transitions, 2421 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-03-04 02:21:34,089 INFO L231 Difference]: Finished difference. Result has 92 places, 134 transitions, 1238 flow [2025-03-04 02:21:34,090 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-03-04 02:21:34,090 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-03-04 02:21:34,090 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 134 transitions, 1238 flow [2025-03-04 02:21:34,090 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-03-04 02:21:34,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:34,090 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-03-04 02:21:34,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:34,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:34,291 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-03-04 02:21:34,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1997095414, now seen corresponding path program 6 times [2025-03-04 02:21:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580173993] [2025-03-04 02:21:34,291 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:21:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:34,303 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:21:34,316 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:21:34,316 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:21:34,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580173993] [2025-03-04 02:21:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580173993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107591155] [2025-03-04 02:21:34,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:21:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:34,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:34,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:21:34,562 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:21:34,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:21:34,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:21:34,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:34,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:21:34,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:34,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107591155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:34,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 16 [2025-03-04 02:21:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612541930] [2025-03-04 02:21:34,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:34,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:21:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:34,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:21:34,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:21:34,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:34,815 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-03-04 02:21:34,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:34,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:34,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:45,829 INFO L124 PetriNetUnfolderBase]: 105752/153601 cut-off events. [2025-03-04 02:21:45,829 INFO L125 PetriNetUnfolderBase]: For 475170/475170 co-relation queries the response was YES. [2025-03-04 02:21:46,431 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-03-04 02:21:46,677 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 341 selfloop transitions, 213 changer transitions 198/756 dead transitions. [2025-03-04 02:21:46,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 756 transitions, 7563 flow [2025-03-04 02:21:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:21:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:21:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 526 transitions. [2025-03-04 02:21:46,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6087962962962963 [2025-03-04 02:21:46,679 INFO L175 Difference]: Start difference. First operand has 92 places, 134 transitions, 1238 flow. Second operand 24 states and 526 transitions. [2025-03-04 02:21:46,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 756 transitions, 7563 flow [2025-03-04 02:21:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 756 transitions, 7353 flow, removed 105 selfloop flow, removed 0 redundant places. [2025-03-04 02:21:47,756 INFO L231 Difference]: Finished difference. Result has 128 places, 265 transitions, 3514 flow [2025-03-04 02:21:47,757 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-03-04 02:21:47,757 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-03-04 02:21:47,757 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 265 transitions, 3514 flow [2025-03-04 02:21:47,757 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-03-04 02:21:47,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:47,758 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-03-04 02:21:47,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:47,958 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-03-04 02:21:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1903065143, now seen corresponding path program 7 times [2025-03-04 02:21:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682585280] [2025-03-04 02:21:47,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:21:47,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:21:47,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:47,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:21:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682585280] [2025-03-04 02:21:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682585280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700239437] [2025-03-04 02:21:48,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:21:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:48,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:48,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:21:48,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:21:48,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:21:48,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:21:48,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:48,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:21:48,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:48,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:21:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700239437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:48,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-03-04 02:21:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462289843] [2025-03-04 02:21:48,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:21:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:48,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:21:48,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:21:48,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 02:21:48,174 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-03-04 02:21:48,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:48,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 02:21:48,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand