./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/chl-name-comparator-subst.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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:42:39,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:42:39,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:42:39,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:42:39,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:42:39,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:42:39,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:42:39,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:42:39,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:42:39,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:42:39,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:42:39,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:42:39,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:42:39,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:42:39,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:42:39,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:42:39,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:42:39,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:42:39,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:42:39,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:42:39,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:42:39,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:42:39,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:39,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:42:39,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:42:39,652 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-03-13 21:42:39,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:42:39,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:42:39,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:42:39,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:42:39,882 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:42:39,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-13 21:42:41,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4931610/a9ca4d2264b5454a961d22c5ca32de91/FLAG174e60540 [2025-03-13 21:42:41,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:42:41,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-13 21:42:41,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4931610/a9ca4d2264b5454a961d22c5ca32de91/FLAG174e60540 [2025-03-13 21:42:41,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4931610/a9ca4d2264b5454a961d22c5ca32de91 [2025-03-13 21:42:41,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:42:41,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:42:41,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:41,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:42:41,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:42:41,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41, skipping insertion in model container [2025-03-13 21:42:41,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:42:41,735 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/chl-name-comparator-subst.wvr.c[4875,4888] [2025-03-13 21:42:41,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:41,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:42:41,771 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/chl-name-comparator-subst.wvr.c[4875,4888] [2025-03-13 21:42:41,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:41,785 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:42:41,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41 WrapperNode [2025-03-13 21:42:41,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:41,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:41,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:42:41,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:42:41,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,814 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-03-13 21:42:41,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:41,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:42:41,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:42:41,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:42:41,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,836 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:42:41,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:42:41,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:42:41,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:42:41,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:42:41,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (1/1) ... [2025-03-13 21:42:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:41,883 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-13 21:42:41,888 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-13 21:42:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:42:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:42:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:42:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:42:41,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:42:41,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:42:41,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:42:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:42:41,906 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:42:42,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:42:42,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:42:42,419 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:42:42,421 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:42:42,421 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:42:42,837 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:42:42,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:42 BoogieIcfgContainer [2025-03-13 21:42:42,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:42:42,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:42:42,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:42:42,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:42:42,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:42:41" (1/3) ... [2025-03-13 21:42:42,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:42, skipping insertion in model container [2025-03-13 21:42:42,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:41" (2/3) ... [2025-03-13 21:42:42,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:42, skipping insertion in model container [2025-03-13 21:42:42,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:42" (3/3) ... [2025-03-13 21:42:42,847 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-13 21:42:42,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:42:42,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:42:42,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:42:42,916 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:42:42,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 93 flow [2025-03-13 21:42:42,975 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2025-03-13 21:42:42,976 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:42,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 7/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-13 21:42:42,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 93 flow [2025-03-13 21:42:42,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 82 flow [2025-03-13 21:42:42,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:42:43,000 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;@41cf0035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:42:43,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:42:43,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:42:43,017 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-03-13 21:42:43,017 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:43,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:43,018 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] [2025-03-13 21:42:43,018 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-13 21:42:43,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash 504047835, now seen corresponding path program 1 times [2025-03-13 21:42:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429649582] [2025-03-13 21:42:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:43,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:43,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:43,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:43,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:43,203 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-13 21:42:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429649582] [2025-03-13 21:42:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429649582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:42:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604200462] [2025-03-13 21:42:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:43,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:42:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:43,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:42:43,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:42:43,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:43,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:43,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:43,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:43,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:43,479 INFO L124 PetriNetUnfolderBase]: 792/1137 cut-off events. [2025-03-13 21:42:43,479 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-13 21:42:43,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1137 events. 792/1137 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3723 event pairs, 608 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2150. Up to 1137 conditions per place. [2025-03-13 21:42:43,491 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 28 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-03-13 21:42:43,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 132 flow [2025-03-13 21:42:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:42:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:42:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-03-13 21:42:43,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:42:43,504 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 82 flow. Second operand 2 states and 39 transitions. [2025-03-13 21:42:43,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 132 flow [2025-03-13 21:42:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:43,512 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 64 flow [2025-03-13 21:42:43,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2025-03-13 21:42:43,518 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-03-13 21:42:43,518 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 64 flow [2025-03-13 21:42:43,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:43,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:43,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:42:43,519 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-13 21:42:43,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1546506045, now seen corresponding path program 1 times [2025-03-13 21:42:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156320629] [2025-03-13 21:42:43,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:43,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:42:43,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:42:43,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:43,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:43,741 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-13 21:42:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156320629] [2025-03-13 21:42:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156320629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:42:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422142798] [2025-03-13 21:42:43,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:43,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:43,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:43,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:43,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:43,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:43,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:43,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:43,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:43,938 INFO L124 PetriNetUnfolderBase]: 792/1138 cut-off events. [2025-03-13 21:42:43,938 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:42:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1138 events. 792/1138 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3723 event pairs, 608 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 2306. Up to 1137 conditions per place. [2025-03-13 21:42:43,946 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-03-13 21:42:43,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-03-13 21:42:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-13 21:42:43,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-13 21:42:43,948 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 64 flow. Second operand 3 states and 42 transitions. [2025-03-13 21:42:43,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-03-13 21:42:43,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:42:43,951 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 76 flow [2025-03-13 21:42:43,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-03-13 21:42:43,952 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-03-13 21:42:43,952 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 76 flow [2025-03-13 21:42:43,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:43,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:43,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:42:43,953 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-13 21:42:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1433334371, now seen corresponding path program 1 times [2025-03-13 21:42:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-03-13 21:42:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:43,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:42:43,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:44,093 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-13 21:42:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-03-13 21:42:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153335464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325288467] [2025-03-13 21:42:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:44,097 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-13 21:42:44,098 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-13 21:42:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:42:44,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:44,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:44,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:44,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-13 21:42:44,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:44,252 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-13 21:42:44,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:44,267 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-13 21:42:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325288467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:44,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:42:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3669090] [2025-03-13 21:42:44,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:44,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:44,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:44,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:42:44,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:44,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:44,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:44,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:44,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:44,413 INFO L124 PetriNetUnfolderBase]: 792/1140 cut-off events. [2025-03-13 21:42:44,413 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:42:44,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1140 events. 792/1140 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3723 event pairs, 608 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 2317. Up to 1137 conditions per place. [2025-03-13 21:42:44,419 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-13 21:42:44,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 146 flow [2025-03-13 21:42:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:42:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:42:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-03-13 21:42:44,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-03-13 21:42:44,420 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 76 flow. Second operand 5 states and 53 transitions. [2025-03-13 21:42:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 146 flow [2025-03-13 21:42:44,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:44,422 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 98 flow [2025-03-13 21:42:44,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-13 21:42:44,422 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-13 21:42:44,423 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 98 flow [2025-03-13 21:42:44,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:44,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:44,423 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:44,431 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-13 21:42:44,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:44,627 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-13 21:42:44,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1797439901, now seen corresponding path program 2 times [2025-03-13 21:42:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:44,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993311527] [2025-03-13 21:42:44,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:44,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:42:44,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:42:44,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993311527] [2025-03-13 21:42:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993311527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:42:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713038913] [2025-03-13 21:42:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:42:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:45,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:42:45,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:42:45,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:45,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:45,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:45,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:45,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:45,704 INFO L124 PetriNetUnfolderBase]: 1926/2789 cut-off events. [2025-03-13 21:42:45,705 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-13 21:42:45,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 2789 events. 1926/2789 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11906 event pairs, 608 based on Foata normal form. 1/2306 useless extension candidates. Maximal degree in co-relation 5639. Up to 1184 conditions per place. [2025-03-13 21:42:45,715 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 75 selfloop transitions, 7 changer transitions 11/94 dead transitions. [2025-03-13 21:42:45,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 94 transitions, 421 flow [2025-03-13 21:42:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-13 21:42:45,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2025-03-13 21:42:45,717 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 98 flow. Second operand 6 states and 115 transitions. [2025-03-13 21:42:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 94 transitions, 421 flow [2025-03-13 21:42:45,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 94 transitions, 411 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:45,718 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 139 flow [2025-03-13 21:42:45,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2025-03-13 21:42:45,719 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-13 21:42:45,719 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 139 flow [2025-03-13 21:42:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:45,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:45,719 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:45,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:42:45,721 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-13 21:42:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1511299577, now seen corresponding path program 3 times [2025-03-13 21:42:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500149430] [2025-03-13 21:42:45,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:45,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:45,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:42:45,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500149430] [2025-03-13 21:42:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500149430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:42:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626743845] [2025-03-13 21:42:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:42:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:46,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:42:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:42:46,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:46,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:46,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:46,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:46,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:46,745 INFO L124 PetriNetUnfolderBase]: 2953/4259 cut-off events. [2025-03-13 21:42:46,745 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2025-03-13 21:42:46,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10364 conditions, 4259 events. 2953/4259 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19069 event pairs, 1209 based on Foata normal form. 1/4030 useless extension candidates. Maximal degree in co-relation 10352. Up to 2089 conditions per place. [2025-03-13 21:42:46,763 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 74 selfloop transitions, 8 changer transitions 11/94 dead transitions. [2025-03-13 21:42:46,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 94 transitions, 486 flow [2025-03-13 21:42:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-03-13 21:42:46,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-03-13 21:42:46,766 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 139 flow. Second operand 6 states and 105 transitions. [2025-03-13 21:42:46,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 94 transitions, 486 flow [2025-03-13 21:42:46,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 482 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:46,773 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 196 flow [2025-03-13 21:42:46,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-03-13 21:42:46,774 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-03-13 21:42:46,774 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 196 flow [2025-03-13 21:42:46,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:46,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:46,775 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:46,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:42:46,775 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-13 21:42:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1881759719, now seen corresponding path program 4 times [2025-03-13 21:42:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574253635] [2025-03-13 21:42:46,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:46,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:42:46,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:46,796 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574253635] [2025-03-13 21:42:47,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574253635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:47,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:47,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:42:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178818244] [2025-03-13 21:42:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:47,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:47,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:47,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:47,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:47,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:47,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:48,337 INFO L124 PetriNetUnfolderBase]: 6978/10217 cut-off events. [2025-03-13 21:42:48,337 INFO L125 PetriNetUnfolderBase]: For 11330/11330 co-relation queries the response was YES. [2025-03-13 21:42:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28381 conditions, 10217 events. 6978/10217 cut-off events. For 11330/11330 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 57385 event pairs, 2510 based on Foata normal form. 1/9636 useless extension candidates. Maximal degree in co-relation 28365. Up to 4351 conditions per place. [2025-03-13 21:42:48,389 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 128 selfloop transitions, 16 changer transitions 3/148 dead transitions. [2025-03-13 21:42:48,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 148 transitions, 1000 flow [2025-03-13 21:42:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2025-03-13 21:42:48,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-03-13 21:42:48,391 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 196 flow. Second operand 7 states and 136 transitions. [2025-03-13 21:42:48,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 148 transitions, 1000 flow [2025-03-13 21:42:48,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 148 transitions, 968 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:48,403 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 372 flow [2025-03-13 21:42:48,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-13 21:42:48,405 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-03-13 21:42:48,405 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 372 flow [2025-03-13 21:42:48,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:48,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:48,405 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:48,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:42:48,406 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-13 21:42:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1932329713, now seen corresponding path program 5 times [2025-03-13 21:42:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570965299] [2025-03-13 21:42:48,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:48,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:48,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:48,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:42:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570965299] [2025-03-13 21:42:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570965299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449813630] [2025-03-13 21:42:48,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:48,988 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-13 21:42:48,989 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-13 21:42:49,048 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:49,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:49,073 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:42:49,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:49,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-13 21:42:49,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:49,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:42:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449813630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:49,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:42:49,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2025-03-13 21:42:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379427076] [2025-03-13 21:42:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:49,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:42:49,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:49,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 372 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:49,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:49,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:49,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:50,544 INFO L124 PetriNetUnfolderBase]: 7030/10307 cut-off events. [2025-03-13 21:42:50,545 INFO L125 PetriNetUnfolderBase]: For 17661/17661 co-relation queries the response was YES. [2025-03-13 21:42:50,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32321 conditions, 10307 events. 7030/10307 cut-off events. For 17661/17661 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 56148 event pairs, 2691 based on Foata normal form. 1/10308 useless extension candidates. Maximal degree in co-relation 32301. Up to 4814 conditions per place. [2025-03-13 21:42:50,598 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 105 selfloop transitions, 27 changer transitions 4/137 dead transitions. [2025-03-13 21:42:50,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 137 transitions, 1023 flow [2025-03-13 21:42:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-03-13 21:42:50,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-03-13 21:42:50,600 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 372 flow. Second operand 7 states and 123 transitions. [2025-03-13 21:42:50,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 137 transitions, 1023 flow [2025-03-13 21:42:50,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 137 transitions, 1023 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:42:50,628 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 630 flow [2025-03-13 21:42:50,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2025-03-13 21:42:50,630 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-13 21:42:50,630 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 630 flow [2025-03-13 21:42:50,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:50,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:50,631 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:50,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:50,831 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,SelfDestructingSolverStorable6 [2025-03-13 21:42:50,832 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-13 21:42:50,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1500123587, now seen corresponding path program 6 times [2025-03-13 21:42:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:50,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238959483] [2025-03-13 21:42:50,832 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:50,846 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:50,868 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:42:50,869 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:42:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:51,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238959483] [2025-03-13 21:42:51,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238959483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:51,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:42:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076193737] [2025-03-13 21:42:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:51,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:51,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:51,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:51,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:51,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:51,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 630 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:51,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:51,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:52,183 INFO L124 PetriNetUnfolderBase]: 7114/10444 cut-off events. [2025-03-13 21:42:52,183 INFO L125 PetriNetUnfolderBase]: For 29190/29190 co-relation queries the response was YES. [2025-03-13 21:42:52,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36170 conditions, 10444 events. 7114/10444 cut-off events. For 29190/29190 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 58408 event pairs, 2371 based on Foata normal form. 1/10445 useless extension candidates. Maximal degree in co-relation 36144. Up to 4702 conditions per place. [2025-03-13 21:42:52,246 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 114 selfloop transitions, 46 changer transitions 2/163 dead transitions. [2025-03-13 21:42:52,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 163 transitions, 1525 flow [2025-03-13 21:42:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-03-13 21:42:52,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-13 21:42:52,248 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 630 flow. Second operand 7 states and 129 transitions. [2025-03-13 21:42:52,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 163 transitions, 1525 flow [2025-03-13 21:42:52,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 163 transitions, 1507 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 21:42:52,304 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 1015 flow [2025-03-13 21:42:52,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1015, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2025-03-13 21:42:52,305 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-03-13 21:42:52,305 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 1015 flow [2025-03-13 21:42:52,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:52,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:52,306 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:52,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:42:52,306 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-13 21:42:52,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1301238681, now seen corresponding path program 7 times [2025-03-13 21:42:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903203251] [2025-03-13 21:42:52,306 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:52,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:52,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:52,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:52,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903203251] [2025-03-13 21:42:52,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903203251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:52,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:52,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:42:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110468752] [2025-03-13 21:42:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:42:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:52,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:42:52,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:42:52,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:52,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 1015 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:52,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:52,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:52,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:53,485 INFO L124 PetriNetUnfolderBase]: 7114/10436 cut-off events. [2025-03-13 21:42:53,485 INFO L125 PetriNetUnfolderBase]: For 41013/41013 co-relation queries the response was YES. [2025-03-13 21:42:53,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39223 conditions, 10436 events. 7114/10436 cut-off events. For 41013/41013 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 57819 event pairs, 2670 based on Foata normal form. 4/10440 useless extension candidates. Maximal degree in co-relation 39191. Up to 4549 conditions per place. [2025-03-13 21:42:53,539 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 101 selfloop transitions, 47 changer transitions 17/166 dead transitions. [2025-03-13 21:42:53,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 166 transitions, 1800 flow [2025-03-13 21:42:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-03-13 21:42:53,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2025-03-13 21:42:53,540 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 1015 flow. Second operand 6 states and 109 transitions. [2025-03-13 21:42:53,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 166 transitions, 1800 flow [2025-03-13 21:42:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 166 transitions, 1697 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:53,604 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 1171 flow [2025-03-13 21:42:53,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1171, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2025-03-13 21:42:53,605 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2025-03-13 21:42:53,605 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 1171 flow [2025-03-13 21:42:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:53,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:53,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:53,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:42:53,606 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-13 21:42:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1105333047, now seen corresponding path program 8 times [2025-03-13 21:42:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787607445] [2025-03-13 21:42:53,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:53,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:42:53,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:42:53,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787607445] [2025-03-13 21:42:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787607445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:42:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894004165] [2025-03-13 21:42:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:53,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:42:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:53,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:42:53,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:42:53,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:53,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 1171 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:53,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:53,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:53,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:55,010 INFO L124 PetriNetUnfolderBase]: 7060/10322 cut-off events. [2025-03-13 21:42:55,010 INFO L125 PetriNetUnfolderBase]: For 50272/50272 co-relation queries the response was YES. [2025-03-13 21:42:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40368 conditions, 10322 events. 7060/10322 cut-off events. For 50272/50272 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 56776 event pairs, 2495 based on Foata normal form. 5/10327 useless extension candidates. Maximal degree in co-relation 40332. Up to 4585 conditions per place. [2025-03-13 21:42:55,057 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 93 selfloop transitions, 53 changer transitions 17/164 dead transitions. [2025-03-13 21:42:55,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 1870 flow [2025-03-13 21:42:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-13 21:42:55,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-03-13 21:42:55,061 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 1171 flow. Second operand 6 states and 110 transitions. [2025-03-13 21:42:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 164 transitions, 1870 flow [2025-03-13 21:42:55,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 164 transitions, 1814 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:55,131 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 1328 flow [2025-03-13 21:42:55,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1328, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2025-03-13 21:42:55,132 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2025-03-13 21:42:55,132 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 1328 flow [2025-03-13 21:42:55,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:55,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:55,132 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:55,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:42:55,133 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-13 21:42:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash 802288031, now seen corresponding path program 9 times [2025-03-13 21:42:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472403661] [2025-03-13 21:42:55,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:55,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:55,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:42:55,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:55,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472403661] [2025-03-13 21:42:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472403661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:55,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:55,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:42:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657468893] [2025-03-13 21:42:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:55,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:55,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:55,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:55,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:55,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 1328 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:55,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:55,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:55,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:56,507 INFO L124 PetriNetUnfolderBase]: 7304/10722 cut-off events. [2025-03-13 21:42:56,508 INFO L125 PetriNetUnfolderBase]: For 62301/62301 co-relation queries the response was YES. [2025-03-13 21:42:56,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42930 conditions, 10722 events. 7304/10722 cut-off events. For 62301/62301 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 60765 event pairs, 2575 based on Foata normal form. 1/10723 useless extension candidates. Maximal degree in co-relation 42892. Up to 4294 conditions per place. [2025-03-13 21:42:56,584 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 177 selfloop transitions, 32 changer transitions 3/213 dead transitions. [2025-03-13 21:42:56,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 213 transitions, 2837 flow [2025-03-13 21:42:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-03-13 21:42:56,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2025-03-13 21:42:56,586 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 1328 flow. Second operand 7 states and 127 transitions. [2025-03-13 21:42:56,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 213 transitions, 2837 flow [2025-03-13 21:42:56,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 213 transitions, 2657 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:56,700 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1630 flow [2025-03-13 21:42:56,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1630, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2025-03-13 21:42:56,701 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2025-03-13 21:42:56,701 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1630 flow [2025-03-13 21:42:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:56,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:56,701 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:56,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:42:56,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1009127677, now seen corresponding path program 10 times [2025-03-13 21:42:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:56,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346217365] [2025-03-13 21:42:56,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:56,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:42:56,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:56,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346217365] [2025-03-13 21:42:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346217365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:42:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777343922] [2025-03-13 21:42:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:42:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:56,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:42:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:42:56,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:56,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 1630 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:56,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:56,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:57,940 INFO L124 PetriNetUnfolderBase]: 7318/10797 cut-off events. [2025-03-13 21:42:57,940 INFO L125 PetriNetUnfolderBase]: For 67701/67701 co-relation queries the response was YES. [2025-03-13 21:42:57,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44528 conditions, 10797 events. 7318/10797 cut-off events. For 67701/67701 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 60260 event pairs, 2808 based on Foata normal form. 5/10802 useless extension candidates. Maximal degree in co-relation 44487. Up to 4877 conditions per place. [2025-03-13 21:42:58,000 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 122 selfloop transitions, 53 changer transitions 18/194 dead transitions. [2025-03-13 21:42:58,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 194 transitions, 2555 flow [2025-03-13 21:42:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-13 21:42:58,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-03-13 21:42:58,001 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 1630 flow. Second operand 6 states and 110 transitions. [2025-03-13 21:42:58,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 194 transitions, 2555 flow [2025-03-13 21:42:58,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 194 transitions, 2511 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:58,136 INFO L231 Difference]: Finished difference. Result has 109 places, 121 transitions, 1802 flow [2025-03-13 21:42:58,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1802, PETRI_PLACES=109, PETRI_TRANSITIONS=121} [2025-03-13 21:42:58,136 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-03-13 21:42:58,136 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 121 transitions, 1802 flow [2025-03-13 21:42:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:58,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:58,136 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:58,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:42:58,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1561755627, now seen corresponding path program 11 times [2025-03-13 21:42:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163441876] [2025-03-13 21:42:58,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:58,147 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:58,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:58,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:42:58,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163441876] [2025-03-13 21:42:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163441876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606343648] [2025-03-13 21:42:58,420 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:58,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:58,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:58,424 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-13 21:42:58,425 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-13 21:42:58,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:42:58,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:58,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:42:58,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:58,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-13 21:42:58,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:58,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:42:58,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606343648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:58,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:42:58,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2025-03-13 21:42:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006269331] [2025-03-13 21:42:58,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:58,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:58,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:58,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:42:58,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:42:58,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 121 transitions, 1802 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:42:58,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:58,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:42:58,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:00,063 INFO L124 PetriNetUnfolderBase]: 8558/12590 cut-off events. [2025-03-13 21:43:00,064 INFO L125 PetriNetUnfolderBase]: For 91262/91262 co-relation queries the response was YES. [2025-03-13 21:43:00,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53956 conditions, 12590 events. 8558/12590 cut-off events. For 91262/91262 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 73376 event pairs, 2626 based on Foata normal form. 1/12591 useless extension candidates. Maximal degree in co-relation 53912. Up to 5219 conditions per place. [2025-03-13 21:43:00,131 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 189 selfloop transitions, 51 changer transitions 2/243 dead transitions. [2025-03-13 21:43:00,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 243 transitions, 3617 flow [2025-03-13 21:43:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-03-13 21:43:00,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-13 21:43:00,132 INFO L175 Difference]: Start difference. First operand has 109 places, 121 transitions, 1802 flow. Second operand 7 states and 129 transitions. [2025-03-13 21:43:00,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 243 transitions, 3617 flow [2025-03-13 21:43:00,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 243 transitions, 3436 flow, removed 30 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:00,329 INFO L231 Difference]: Finished difference. Result has 116 places, 152 transitions, 2435 flow [2025-03-13 21:43:00,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2435, PETRI_PLACES=116, PETRI_TRANSITIONS=152} [2025-03-13 21:43:00,330 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2025-03-13 21:43:00,330 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 152 transitions, 2435 flow [2025-03-13 21:43:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-13 21:43:00,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:00,330 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:00,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:43:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:00,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:00,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -21722341, now seen corresponding path program 12 times [2025-03-13 21:43:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550694950] [2025-03-13 21:43:00,532 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:43:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:00,544 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-03-13 21:43:00,568 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-13 21:43:00,568 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:43:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:00,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550694950] [2025-03-13 21:43:00,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550694950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:00,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:00,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:43:00,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480055807] [2025-03-13 21:43:00,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:00,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:43:00,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:00,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:43:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:43:00,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:00,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 152 transitions, 2435 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:00,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:00,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:00,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:02,406 INFO L124 PetriNetUnfolderBase]: 8558/12576 cut-off events. [2025-03-13 21:43:02,406 INFO L125 PetriNetUnfolderBase]: For 103730/103730 co-relation queries the response was YES. [2025-03-13 21:43:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55866 conditions, 12576 events. 8558/12576 cut-off events. For 103730/103730 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 71604 event pairs, 3003 based on Foata normal form. 7/12583 useless extension candidates. Maximal degree in co-relation 55818. Up to 5024 conditions per place. [2025-03-13 21:43:02,519 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 128 selfloop transitions, 75 changer transitions 22/226 dead transitions. [2025-03-13 21:43:02,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 226 transitions, 3464 flow [2025-03-13 21:43:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:43:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:43:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-13 21:43:02,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-13 21:43:02,520 INFO L175 Difference]: Start difference. First operand has 116 places, 152 transitions, 2435 flow. Second operand 6 states and 108 transitions. [2025-03-13 21:43:02,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 226 transitions, 3464 flow [2025-03-13 21:43:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 226 transitions, 3426 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-13 21:43:02,810 INFO L231 Difference]: Finished difference. Result has 123 places, 152 transitions, 2571 flow [2025-03-13 21:43:02,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2571, PETRI_PLACES=123, PETRI_TRANSITIONS=152} [2025-03-13 21:43:02,811 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2025-03-13 21:43:02,811 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 2571 flow [2025-03-13 21:43:02,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:02,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:02,811 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:02,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:43:02,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:02,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1515445798, now seen corresponding path program 1 times [2025-03-13 21:43:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318227944] [2025-03-13 21:43:02,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:02,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:43:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:02,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:02,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318227944] [2025-03-13 21:43:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318227944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:03,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:03,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:43:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358719573] [2025-03-13 21:43:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:03,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:03,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:03,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:03,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 2571 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:03,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:04,416 INFO L124 PetriNetUnfolderBase]: 9770/14267 cut-off events. [2025-03-13 21:43:04,416 INFO L125 PetriNetUnfolderBase]: For 118908/118908 co-relation queries the response was YES. [2025-03-13 21:43:04,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63269 conditions, 14267 events. 9770/14267 cut-off events. For 118908/118908 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 83095 event pairs, 2041 based on Foata normal form. 13/14280 useless extension candidates. Maximal degree in co-relation 63218. Up to 7775 conditions per place. [2025-03-13 21:43:04,562 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 185 selfloop transitions, 57 changer transitions 1/244 dead transitions. [2025-03-13 21:43:04,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 244 transitions, 3686 flow [2025-03-13 21:43:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-13 21:43:04,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2025-03-13 21:43:04,563 INFO L175 Difference]: Start difference. First operand has 123 places, 152 transitions, 2571 flow. Second operand 7 states and 134 transitions. [2025-03-13 21:43:04,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 244 transitions, 3686 flow [2025-03-13 21:43:04,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 244 transitions, 3534 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-13 21:43:04,869 INFO L231 Difference]: Finished difference. Result has 126 places, 159 transitions, 2735 flow [2025-03-13 21:43:04,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2735, PETRI_PLACES=126, PETRI_TRANSITIONS=159} [2025-03-13 21:43:04,870 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 91 predicate places. [2025-03-13 21:43:04,872 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 2735 flow [2025-03-13 21:43:04,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:04,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:04,873 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:04,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:43:04,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:04,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1935467448, now seen corresponding path program 1 times [2025-03-13 21:43:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894553842] [2025-03-13 21:43:04,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:04,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:04,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:43:04,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:04,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:04,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894553842] [2025-03-13 21:43:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894553842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:43:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514048941] [2025-03-13 21:43:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:05,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:05,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:05,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:05,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 2735 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:05,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:05,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:05,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:06,918 INFO L124 PetriNetUnfolderBase]: 11890/17443 cut-off events. [2025-03-13 21:43:06,918 INFO L125 PetriNetUnfolderBase]: For 148493/148493 co-relation queries the response was YES. [2025-03-13 21:43:06,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75789 conditions, 17443 events. 11890/17443 cut-off events. For 148493/148493 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 104212 event pairs, 1770 based on Foata normal form. 12/17455 useless extension candidates. Maximal degree in co-relation 75737. Up to 10024 conditions per place. [2025-03-13 21:43:07,043 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 260 selfloop transitions, 36 changer transitions 1/298 dead transitions. [2025-03-13 21:43:07,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 298 transitions, 5063 flow [2025-03-13 21:43:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-13 21:43:07,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2025-03-13 21:43:07,045 INFO L175 Difference]: Start difference. First operand has 126 places, 159 transitions, 2735 flow. Second operand 7 states and 121 transitions. [2025-03-13 21:43:07,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 298 transitions, 5063 flow [2025-03-13 21:43:07,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 4914 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:07,392 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 3128 flow [2025-03-13 21:43:07,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2649, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3128, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2025-03-13 21:43:07,393 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2025-03-13 21:43:07,393 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 3128 flow [2025-03-13 21:43:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:07,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:07,393 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:43:07,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:07,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1244278502, now seen corresponding path program 2 times [2025-03-13 21:43:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606827775] [2025-03-13 21:43:07,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:07,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:43:07,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-13 21:43:07,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:07,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606827775] [2025-03-13 21:43:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606827775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:07,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:43:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744509963] [2025-03-13 21:43:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:07,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:07,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:07,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:07,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:07,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 3128 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:07,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:07,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:07,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:10,058 INFO L124 PetriNetUnfolderBase]: 14147/20818 cut-off events. [2025-03-13 21:43:10,058 INFO L125 PetriNetUnfolderBase]: For 181418/181418 co-relation queries the response was YES. [2025-03-13 21:43:10,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91566 conditions, 20818 events. 14147/20818 cut-off events. For 181418/181418 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 129748 event pairs, 4135 based on Foata normal form. 13/20831 useless extension candidates. Maximal degree in co-relation 91509. Up to 8364 conditions per place. [2025-03-13 21:43:10,189 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 247 selfloop transitions, 55 changer transitions 1/304 dead transitions. [2025-03-13 21:43:10,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 304 transitions, 4892 flow [2025-03-13 21:43:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-03-13 21:43:10,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-03-13 21:43:10,190 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 3128 flow. Second operand 7 states and 146 transitions. [2025-03-13 21:43:10,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 304 transitions, 4892 flow [2025-03-13 21:43:10,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 304 transitions, 4842 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:10,663 INFO L231 Difference]: Finished difference. Result has 143 places, 187 transitions, 3387 flow [2025-03-13 21:43:10,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3387, PETRI_PLACES=143, PETRI_TRANSITIONS=187} [2025-03-13 21:43:10,664 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 108 predicate places. [2025-03-13 21:43:10,664 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 187 transitions, 3387 flow [2025-03-13 21:43:10,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:10,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:10,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:43:10,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1769371378, now seen corresponding path program 2 times [2025-03-13 21:43:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-13 21:43:10,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:10,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:43:10,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:10,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:43:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-13 21:43:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890890127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:43:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526775245] [2025-03-13 21:43:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:10,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:10,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:10,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:10,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:10,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 187 transitions, 3387 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:10,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:10,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:10,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:13,838 INFO L124 PetriNetUnfolderBase]: 14743/21811 cut-off events. [2025-03-13 21:43:13,838 INFO L125 PetriNetUnfolderBase]: For 204004/204004 co-relation queries the response was YES. [2025-03-13 21:43:14,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97164 conditions, 21811 events. 14743/21811 cut-off events. For 204004/204004 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 137960 event pairs, 3924 based on Foata normal form. 12/21823 useless extension candidates. Maximal degree in co-relation 97104. Up to 8525 conditions per place. [2025-03-13 21:43:14,086 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 233 selfloop transitions, 71 changer transitions 1/306 dead transitions. [2025-03-13 21:43:14,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 306 transitions, 5214 flow [2025-03-13 21:43:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-03-13 21:43:14,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-03-13 21:43:14,088 INFO L175 Difference]: Start difference. First operand has 143 places, 187 transitions, 3387 flow. Second operand 7 states and 139 transitions. [2025-03-13 21:43:14,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 306 transitions, 5214 flow [2025-03-13 21:43:14,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 306 transitions, 5028 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:14,928 INFO L231 Difference]: Finished difference. Result has 149 places, 199 transitions, 3639 flow [2025-03-13 21:43:14,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3639, PETRI_PLACES=149, PETRI_TRANSITIONS=199} [2025-03-13 21:43:14,929 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-03-13 21:43:14,929 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 199 transitions, 3639 flow [2025-03-13 21:43:14,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:14,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:14,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:14,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:43:14,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:14,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1743025594, now seen corresponding path program 3 times [2025-03-13 21:43:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246641574] [2025-03-13 21:43:14,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:14,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-13 21:43:14,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-13 21:43:14,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:43:14,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246641574] [2025-03-13 21:43:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246641574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:43:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277475403] [2025-03-13 21:43:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:15,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:15,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:15,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:15,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 199 transitions, 3639 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:15,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:15,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:15,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:17,822 INFO L124 PetriNetUnfolderBase]: 15423/22936 cut-off events. [2025-03-13 21:43:17,823 INFO L125 PetriNetUnfolderBase]: For 215128/215128 co-relation queries the response was YES. [2025-03-13 21:43:17,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101386 conditions, 22936 events. 15423/22936 cut-off events. For 215128/215128 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 147032 event pairs, 4560 based on Foata normal form. 13/22949 useless extension candidates. Maximal degree in co-relation 101323. Up to 8118 conditions per place. [2025-03-13 21:43:17,966 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 237 selfloop transitions, 74 changer transitions 1/313 dead transitions. [2025-03-13 21:43:17,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 313 transitions, 5416 flow [2025-03-13 21:43:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-13 21:43:17,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5436507936507936 [2025-03-13 21:43:17,967 INFO L175 Difference]: Start difference. First operand has 149 places, 199 transitions, 3639 flow. Second operand 7 states and 137 transitions. [2025-03-13 21:43:17,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 313 transitions, 5416 flow [2025-03-13 21:43:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 313 transitions, 5296 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:18,655 INFO L231 Difference]: Finished difference. Result has 157 places, 210 transitions, 4045 flow [2025-03-13 21:43:18,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4045, PETRI_PLACES=157, PETRI_TRANSITIONS=210} [2025-03-13 21:43:18,656 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 122 predicate places. [2025-03-13 21:43:18,656 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 210 transitions, 4045 flow [2025-03-13 21:43:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:18,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:18,656 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:43:18,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -197634126, now seen corresponding path program 4 times [2025-03-13 21:43:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15244356] [2025-03-13 21:43:18,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:18,664 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:43:18,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:18,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15244356] [2025-03-13 21:43:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15244356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:18,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:43:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635913012] [2025-03-13 21:43:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:18,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:43:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:18,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:43:18,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:43:18,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:18,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 210 transitions, 4045 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-13 21:43:18,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:18,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:18,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:22,707 INFO L124 PetriNetUnfolderBase]: 15855/23574 cut-off events. [2025-03-13 21:43:22,707 INFO L125 PetriNetUnfolderBase]: For 242075/242075 co-relation queries the response was YES. [2025-03-13 21:43:22,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105585 conditions, 23574 events. 15855/23574 cut-off events. For 242075/242075 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 152553 event pairs, 4494 based on Foata normal form. 8/23582 useless extension candidates. Maximal degree in co-relation 105518. Up to 8798 conditions per place. [2025-03-13 21:43:22,921 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 248 selfloop transitions, 78 changer transitions 1/328 dead transitions. [2025-03-13 21:43:22,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 328 transitions, 5800 flow [2025-03-13 21:43:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-13 21:43:22,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-13 21:43:22,922 INFO L175 Difference]: Start difference. First operand has 157 places, 210 transitions, 4045 flow. Second operand 7 states and 147 transitions. [2025-03-13 21:43:22,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 328 transitions, 5800 flow [2025-03-13 21:43:23,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 328 transitions, 5706 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:23,776 INFO L231 Difference]: Finished difference. Result has 164 places, 218 transitions, 4330 flow [2025-03-13 21:43:23,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3956, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4330, PETRI_PLACES=164, PETRI_TRANSITIONS=218} [2025-03-13 21:43:23,777 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 129 predicate places. [2025-03-13 21:43:23,777 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 218 transitions, 4330 flow [2025-03-13 21:43:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-13 21:43:23,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:23,777 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:43:23,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -160031976, now seen corresponding path program 3 times [2025-03-13 21:43:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596970284] [2025-03-13 21:43:23,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:23,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-13 21:43:23,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-13 21:43:23,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:43:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596970284] [2025-03-13 21:43:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596970284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:43:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929696927] [2025-03-13 21:43:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:43:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:43:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:43:23,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:23,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 218 transitions, 4330 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-13 21:43:23,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:23,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:23,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:26,842 INFO L124 PetriNetUnfolderBase]: 16287/24212 cut-off events. [2025-03-13 21:43:26,842 INFO L125 PetriNetUnfolderBase]: For 262466/262466 co-relation queries the response was YES. [2025-03-13 21:43:27,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110176 conditions, 24212 events. 16287/24212 cut-off events. For 262466/262466 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 156805 event pairs, 4606 based on Foata normal form. 8/24220 useless extension candidates. Maximal degree in co-relation 110106. Up to 8976 conditions per place. [2025-03-13 21:43:27,087 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 245 selfloop transitions, 84 changer transitions 1/331 dead transitions. [2025-03-13 21:43:27,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 331 transitions, 6173 flow [2025-03-13 21:43:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:43:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:43:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-03-13 21:43:27,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-13 21:43:27,088 INFO L175 Difference]: Start difference. First operand has 164 places, 218 transitions, 4330 flow. Second operand 7 states and 142 transitions. [2025-03-13 21:43:27,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 331 transitions, 6173 flow [2025-03-13 21:43:28,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 331 transitions, 6005 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:28,339 INFO L231 Difference]: Finished difference. Result has 170 places, 227 transitions, 4618 flow [2025-03-13 21:43:28,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4618, PETRI_PLACES=170, PETRI_TRANSITIONS=227} [2025-03-13 21:43:28,340 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 135 predicate places. [2025-03-13 21:43:28,340 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 227 transitions, 4618 flow [2025-03-13 21:43:28,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-13 21:43:28,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:28,340 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:28,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:43:28,340 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:28,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1879779574, now seen corresponding path program 5 times [2025-03-13 21:43:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336838690] [2025-03-13 21:43:28,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:28,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-13 21:43:28,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:28,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:43:28,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336838690] [2025-03-13 21:43:28,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336838690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:28,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539414519] [2025-03-13 21:43:28,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:28,752 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-13 21:43:28,753 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-13 21:43:28,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-13 21:43:28,850 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:28,850 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-13 21:43:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:28,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:43:28,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:29,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:43:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539414519] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:43:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 19 [2025-03-13 21:43:29,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701542361] [2025-03-13 21:43:29,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:29,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:43:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:29,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:43:29,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:43:29,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-13 21:43:29,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 227 transitions, 4618 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-13 21:43:29,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:29,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-13 21:43:29,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand