./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/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-?-798a7b3-m [2025-03-04 02:18:43,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:43,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:18:43,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:43,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:43,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:43,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:43,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:43,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:43,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:43,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:43,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:43,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:43,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:43,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:43,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:43,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:43,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:43,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:43,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:43,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:43,190 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-04 02:18:43,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:43,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:43,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:43,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:43,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:43,415 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-04 02:18:44,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307a9b9f9/b0e3bac0b6d047e4b582ac00a6b9b1bd/FLAG4c4d1345f [2025-03-04 02:18:44,808 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:44,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-04 02:18:44,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307a9b9f9/b0e3bac0b6d047e4b582ac00a6b9b1bd/FLAG4c4d1345f [2025-03-04 02:18:44,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307a9b9f9/b0e3bac0b6d047e4b582ac00a6b9b1bd [2025-03-04 02:18:44,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:44,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:44,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:44,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:44,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:44,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:44" (1/1) ... [2025-03-04 02:18:44,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4f9723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:44, skipping insertion in model container [2025-03-04 02:18:44,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:44" (1/1) ... [2025-03-04 02:18:44,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:44,990 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-04 02:18:45,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:45,009 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:45,034 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-04 02:18:45,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:45,056 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:45,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45 WrapperNode [2025-03-04 02:18:45,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:45,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:45,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:45,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:45,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,085 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-03-04 02:18:45,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:45,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:45,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:45,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:45,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,106 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-04 02:18:45,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:45,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:45,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:45,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:45,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (1/1) ... [2025-03-04 02:18:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:45,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:18:45,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:45,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:45,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:18:45,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:45,160 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:18:45,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:45,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:45,582 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:45,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:45,876 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:45,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:45,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:45 BoogieIcfgContainer [2025-03-04 02:18:45,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:45,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:45,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:45,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:45,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:44" (1/3) ... [2025-03-04 02:18:45,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4399d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:45, skipping insertion in model container [2025-03-04 02:18:45,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:45" (2/3) ... [2025-03-04 02:18:45,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4399d234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:45, skipping insertion in model container [2025-03-04 02:18:45,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:45" (3/3) ... [2025-03-04 02:18:45,885 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-04 02:18:45,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:45,899 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-04 02:18:45,900 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:45,953 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:18:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 93 flow [2025-03-04 02:18:46,011 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2025-03-04 02:18:46,012 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:46,018 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-04 02:18:46,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 93 flow [2025-03-04 02:18:46,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 82 flow [2025-03-04 02:18:46,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:46,039 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;@7431f2df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:46,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:18:46,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:46,048 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-03-04 02:18:46,049 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:46,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,049 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-04 02:18:46,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash 504047835, now seen corresponding path program 1 times [2025-03-04 02:18:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446015399] [2025-03-04 02:18:46,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:46,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:46,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446015399] [2025-03-04 02:18:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446015399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:46,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:46,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283052003] [2025-03-04 02:18:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:18:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:18:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:18:46,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:46,314 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-04 02:18:46,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:46,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,539 INFO L124 PetriNetUnfolderBase]: 792/1137 cut-off events. [2025-03-04 02:18:46,540 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 02:18:46,542 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-04 02:18:46,549 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 28 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-03-04 02:18:46,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 132 flow [2025-03-04 02:18:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:18:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:18:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-03-04 02:18:46,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 02:18:46,563 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 82 flow. Second operand 2 states and 39 transitions. [2025-03-04 02:18:46,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 132 flow [2025-03-04 02:18:46,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:46,570 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 64 flow [2025-03-04 02:18:46,572 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-04 02:18:46,575 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-03-04 02:18:46,576 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 64 flow [2025-03-04 02:18:46,576 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-04 02:18:46,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,576 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-04 02:18:46,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:46,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1546506045, now seen corresponding path program 1 times [2025-03-04 02:18:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609557411] [2025-03-04 02:18:46,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:46,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:46,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609557411] [2025-03-04 02:18:46,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609557411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:46,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503502709] [2025-03-04 02:18:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:46,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:46,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:46,787 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-04 02:18:46,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,939 INFO L124 PetriNetUnfolderBase]: 792/1138 cut-off events. [2025-03-04 02:18:46,939 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:18:46,943 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-04 02:18:46,949 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-03-04 02:18:46,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-03-04 02:18:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-04 02:18:46,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:18:46,951 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 64 flow. Second operand 3 states and 42 transitions. [2025-03-04 02:18:46,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-03-04 02:18:46,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:46,953 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 76 flow [2025-03-04 02:18:46,954 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-04 02:18:46,955 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-03-04 02:18:46,955 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 76 flow [2025-03-04 02:18:46,955 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-04 02:18:46,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,955 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-04 02:18:46,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:46,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:46,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1433334371, now seen corresponding path program 1 times [2025-03-04 02:18:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989978160] [2025-03-04 02:18:46,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:18:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989978160] [2025-03-04 02:18:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989978160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685526405] [2025-03-04 02:18:47,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:47,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:47,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:47,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:47,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:18:47,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:18:47,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:47,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:47,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:47,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:47,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685526405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:47,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 02:18:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126546250] [2025-03-04 02:18:47,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:47,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:47,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:47,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:47,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:47,262 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-04 02:18:47,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:47,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:47,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:47,423 INFO L124 PetriNetUnfolderBase]: 792/1140 cut-off events. [2025-03-04 02:18:47,423 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 02:18:47,424 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-04 02:18:47,428 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-04 02:18:47,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 146 flow [2025-03-04 02:18:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-03-04 02:18:47,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-03-04 02:18:47,429 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 76 flow. Second operand 5 states and 53 transitions. [2025-03-04 02:18:47,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 146 flow [2025-03-04 02:18:47,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:47,430 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 98 flow [2025-03-04 02:18:47,430 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-04 02:18:47,431 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 02:18:47,431 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 98 flow [2025-03-04 02:18:47,431 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-04 02:18:47,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:47,431 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-04 02:18:47,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:18:47,632 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-04 02:18:47,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:47,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1797439901, now seen corresponding path program 2 times [2025-03-04 02:18:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:47,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445109396] [2025-03-04 02:18:47,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:47,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:18:47,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:18:47,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:48,196 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-04 02:18:48,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445109396] [2025-03-04 02:18:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445109396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751005526] [2025-03-04 02:18:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:48,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:48,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:48,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:48,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:48,197 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-04 02:18:48,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:48,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:48,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:48,613 INFO L124 PetriNetUnfolderBase]: 1926/2789 cut-off events. [2025-03-04 02:18:48,613 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 02:18:48,616 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-04 02:18:48,623 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 75 selfloop transitions, 7 changer transitions 11/94 dead transitions. [2025-03-04 02:18:48,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 94 transitions, 421 flow [2025-03-04 02:18:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-04 02:18:48,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2025-03-04 02:18:48,624 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 98 flow. Second operand 6 states and 115 transitions. [2025-03-04 02:18:48,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 94 transitions, 421 flow [2025-03-04 02:18:48,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 94 transitions, 411 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:48,626 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 139 flow [2025-03-04 02:18:48,626 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-04 02:18:48,627 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-04 02:18:48,627 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 139 flow [2025-03-04 02:18:48,627 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-04 02:18:48,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:48,627 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-04 02:18:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:48,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:48,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1511299577, now seen corresponding path program 3 times [2025-03-04 02:18:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826474923] [2025-03-04 02:18:48,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:48,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:18:48,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:18:48,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:48,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:49,179 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-04 02:18:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826474923] [2025-03-04 02:18:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826474923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007206618] [2025-03-04 02:18:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:49,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:49,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:49,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:49,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:49,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 139 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-04 02:18:49,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:49,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:49,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:49,873 INFO L124 PetriNetUnfolderBase]: 3751/5506 cut-off events. [2025-03-04 02:18:49,873 INFO L125 PetriNetUnfolderBase]: For 2402/2402 co-relation queries the response was YES. [2025-03-04 02:18:49,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13523 conditions, 5506 events. 3751/5506 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27869 event pairs, 1525 based on Foata normal form. 1/5207 useless extension candidates. Maximal degree in co-relation 13511. Up to 2756 conditions per place. [2025-03-04 02:18:49,899 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 110 selfloop transitions, 11 changer transitions 4/126 dead transitions. [2025-03-04 02:18:49,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 126 transitions, 711 flow [2025-03-04 02:18:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-03-04 02:18:49,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2025-03-04 02:18:49,902 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 139 flow. Second operand 7 states and 125 transitions. [2025-03-04 02:18:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 126 transitions, 711 flow [2025-03-04 02:18:49,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 126 transitions, 705 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:49,912 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 247 flow [2025-03-04 02:18:49,912 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-04 02:18:49,913 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2025-03-04 02:18:49,913 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 247 flow [2025-03-04 02:18:49,913 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-04 02:18:49,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:49,913 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-04 02:18:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:49,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1848331513, now seen corresponding path program 4 times [2025-03-04 02:18:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779141901] [2025-03-04 02:18:49,914 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:49,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:18:49,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:18:49,950 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:49,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,414 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-04 02:18:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779141901] [2025-03-04 02:18:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779141901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874787408] [2025-03-04 02:18:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:50,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:50,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:50,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:50,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 247 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-04 02:18:50,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:50,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:50,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:51,365 INFO L124 PetriNetUnfolderBase]: 5698/8334 cut-off events. [2025-03-04 02:18:51,366 INFO L125 PetriNetUnfolderBase]: For 8355/8355 co-relation queries the response was YES. [2025-03-04 02:18:51,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23714 conditions, 8334 events. 5698/8334 cut-off events. For 8355/8355 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 43447 event pairs, 2209 based on Foata normal form. 1/8335 useless extension candidates. Maximal degree in co-relation 23697. Up to 3833 conditions per place. [2025-03-04 02:18:51,417 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 94 selfloop transitions, 27 changer transitions 2/124 dead transitions. [2025-03-04 02:18:51,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 783 flow [2025-03-04 02:18:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-03-04 02:18:51,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2025-03-04 02:18:51,419 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 247 flow. Second operand 7 states and 125 transitions. [2025-03-04 02:18:51,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 783 flow [2025-03-04 02:18:51,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 774 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:51,434 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 466 flow [2025-03-04 02:18:51,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-03-04 02:18:51,436 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-03-04 02:18:51,436 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 466 flow [2025-03-04 02:18:51,437 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-04 02:18:51,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:51,437 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-04 02:18:51,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:18:51,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -415157073, now seen corresponding path program 5 times [2025-03-04 02:18:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048828567] [2025-03-04 02:18:51,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:51,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:18:51,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:18:51,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:52,042 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-04 02:18:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048828567] [2025-03-04 02:18:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048828567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157857370] [2025-03-04 02:18:52,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:52,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:52,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:52,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:18:52,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:18:52,132 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:18:52,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:52,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:18:52,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:52,384 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-04 02:18:52,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157857370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-03-04 02:18:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930674262] [2025-03-04 02:18:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:52,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:52,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:52,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:18:52,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:52,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 466 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-04 02:18:52,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:52,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:52,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:53,238 INFO L124 PetriNetUnfolderBase]: 5698/8328 cut-off events. [2025-03-04 02:18:53,238 INFO L125 PetriNetUnfolderBase]: For 18711/18711 co-relation queries the response was YES. [2025-03-04 02:18:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27830 conditions, 8328 events. 5698/8328 cut-off events. For 18711/18711 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 43915 event pairs, 2290 based on Foata normal form. 3/8331 useless extension candidates. Maximal degree in co-relation 27808. Up to 3757 conditions per place. [2025-03-04 02:18:53,275 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 102 selfloop transitions, 19 changer transitions 15/137 dead transitions. [2025-03-04 02:18:53,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1127 flow [2025-03-04 02:18:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-03-04 02:18:53,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2025-03-04 02:18:53,279 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 466 flow. Second operand 6 states and 109 transitions. [2025-03-04 02:18:53,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1127 flow [2025-03-04 02:18:53,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 1101 flow, removed 13 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:53,314 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 588 flow [2025-03-04 02:18:53,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2025-03-04 02:18:53,314 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-03-04 02:18:53,314 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 588 flow [2025-03-04 02:18:53,314 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-04 02:18:53,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:53,314 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-04 02:18:53,323 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-04 02:18:53,515 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-04 02:18:53,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:53,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash -52802029, now seen corresponding path program 6 times [2025-03-04 02:18:53,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:53,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274532488] [2025-03-04 02:18:53,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:53,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:18:53,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:18:53,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:53,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:53,802 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-04 02:18:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274532488] [2025-03-04 02:18:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274532488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966886295] [2025-03-04 02:18:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:53,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:53,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:53,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:53,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 588 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-04 02:18:53,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:53,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:53,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:54,626 INFO L124 PetriNetUnfolderBase]: 5664/8259 cut-off events. [2025-03-04 02:18:54,627 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-03-04 02:18:54,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29728 conditions, 8259 events. 5664/8259 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 43390 event pairs, 2158 based on Foata normal form. 3/8262 useless extension candidates. Maximal degree in co-relation 29701. Up to 3757 conditions per place. [2025-03-04 02:18:54,669 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 92 selfloop transitions, 23 changer transitions 13/129 dead transitions. [2025-03-04 02:18:54,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 1100 flow [2025-03-04 02:18:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-04 02:18:54,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-03-04 02:18:54,671 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 588 flow. Second operand 6 states and 110 transitions. [2025-03-04 02:18:54,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 1100 flow [2025-03-04 02:18:54,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 1085 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:54,714 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 675 flow [2025-03-04 02:18:54,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-03-04 02:18:54,715 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2025-03-04 02:18:54,715 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 675 flow [2025-03-04 02:18:54,716 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-04 02:18:54,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:54,716 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-04 02:18:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:18:54,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash -148058375, now seen corresponding path program 7 times [2025-03-04 02:18:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661660665] [2025-03-04 02:18:54,717 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:54,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:18:54,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:18:54,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:54,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:55,217 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-04 02:18:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:55,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661660665] [2025-03-04 02:18:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661660665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:55,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047585166] [2025-03-04 02:18:55,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:55,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:55,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:55,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:55,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:55,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 675 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-04 02:18:55,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:55,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:55,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:56,377 INFO L124 PetriNetUnfolderBase]: 6944/10109 cut-off events. [2025-03-04 02:18:56,378 INFO L125 PetriNetUnfolderBase]: For 41656/41656 co-relation queries the response was YES. [2025-03-04 02:18:56,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37859 conditions, 10109 events. 6944/10109 cut-off events. For 41656/41656 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 55876 event pairs, 2405 based on Foata normal form. 1/10110 useless extension candidates. Maximal degree in co-relation 37830. Up to 4318 conditions per place. [2025-03-04 02:18:56,422 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 151 selfloop transitions, 34 changer transitions 1/187 dead transitions. [2025-03-04 02:18:56,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 187 transitions, 1987 flow [2025-03-04 02:18:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2025-03-04 02:18:56,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2025-03-04 02:18:56,424 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 675 flow. Second operand 7 states and 130 transitions. [2025-03-04 02:18:56,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 187 transitions, 1987 flow [2025-03-04 02:18:56,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 187 transitions, 1888 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:56,479 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 1074 flow [2025-03-04 02:18:56,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1074, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2025-03-04 02:18:56,481 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-03-04 02:18:56,481 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 1074 flow [2025-03-04 02:18:56,481 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-04 02:18:56,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:56,481 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-04 02:18:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:18:56,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2111655145, now seen corresponding path program 8 times [2025-03-04 02:18:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786076178] [2025-03-04 02:18:56,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:56,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:18:56,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:18:56,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:56,724 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-04 02:18:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786076178] [2025-03-04 02:18:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786076178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:56,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:56,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754232200] [2025-03-04 02:18:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:56,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:56,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:56,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:56,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:56,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 1074 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-04 02:18:56,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:56,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:56,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:57,599 INFO L124 PetriNetUnfolderBase]: 6957/10157 cut-off events. [2025-03-04 02:18:57,599 INFO L125 PetriNetUnfolderBase]: For 49269/49269 co-relation queries the response was YES. [2025-03-04 02:18:57,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40061 conditions, 10157 events. 6957/10157 cut-off events. For 49269/49269 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54847 event pairs, 2803 based on Foata normal form. 3/10160 useless extension candidates. Maximal degree in co-relation 40028. Up to 4345 conditions per place. [2025-03-04 02:18:57,652 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 100 selfloop transitions, 46 changer transitions 16/163 dead transitions. [2025-03-04 02:18:57,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 1836 flow [2025-03-04 02:18:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-03-04 02:18:57,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-03-04 02:18:57,654 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 1074 flow. Second operand 6 states and 105 transitions. [2025-03-04 02:18:57,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 1836 flow [2025-03-04 02:18:57,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 163 transitions, 1800 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:57,735 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 1288 flow [2025-03-04 02:18:57,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1288, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2025-03-04 02:18:57,736 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2025-03-04 02:18:57,736 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 1288 flow [2025-03-04 02:18:57,736 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-04 02:18:57,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:57,736 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-04 02:18:57,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:18:57,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1412262479, now seen corresponding path program 9 times [2025-03-04 02:18:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184183630] [2025-03-04 02:18:57,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:57,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:18:57,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-04 02:18:57,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:57,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:57,975 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-04 02:18:57,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:57,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184183630] [2025-03-04 02:18:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184183630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:57,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:57,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675085983] [2025-03-04 02:18:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:57,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:57,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:57,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:57,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 1288 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-04 02:18:57,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:57,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:57,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:58,828 INFO L124 PetriNetUnfolderBase]: 6911/10058 cut-off events. [2025-03-04 02:18:58,828 INFO L125 PetriNetUnfolderBase]: For 62531/62531 co-relation queries the response was YES. [2025-03-04 02:18:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42171 conditions, 10058 events. 6911/10058 cut-off events. For 62531/62531 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 54060 event pairs, 2573 based on Foata normal form. 4/10062 useless extension candidates. Maximal degree in co-relation 42133. Up to 4001 conditions per place. [2025-03-04 02:18:58,886 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 97 selfloop transitions, 55 changer transitions 19/172 dead transitions. [2025-03-04 02:18:58,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 172 transitions, 2096 flow [2025-03-04 02:18:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-04 02:18:58,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-03-04 02:18:58,887 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 1288 flow. Second operand 6 states and 110 transitions. [2025-03-04 02:18:58,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 172 transitions, 2096 flow [2025-03-04 02:18:59,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 172 transitions, 2037 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:59,036 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 1476 flow [2025-03-04 02:18:59,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1476, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-03-04 02:18:59,038 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2025-03-04 02:18:59,038 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 1476 flow [2025-03-04 02:18:59,038 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-04 02:18:59,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:59,038 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-04 02:18:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:18:59,039 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-04 02:18:59,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2133215253, now seen corresponding path program 10 times [2025-03-04 02:18:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530920137] [2025-03-04 02:18:59,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:59,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:18:59,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:18:59,061 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:59,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:59,270 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-04 02:18:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:59,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530920137] [2025-03-04 02:18:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530920137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:59,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957879743] [2025-03-04 02:18:59,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:59,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:59,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:59,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:59,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:18:59,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 1476 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-04 02:18:59,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:59,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:18:59,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:00,411 INFO L124 PetriNetUnfolderBase]: 6855/9943 cut-off events. [2025-03-04 02:19:00,412 INFO L125 PetriNetUnfolderBase]: For 70979/70979 co-relation queries the response was YES. [2025-03-04 02:19:00,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42688 conditions, 9943 events. 6855/9943 cut-off events. For 70979/70979 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 53098 event pairs, 2491 based on Foata normal form. 4/9947 useless extension candidates. Maximal degree in co-relation 42648. Up to 4001 conditions per place. [2025-03-04 02:19:00,465 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 93 selfloop transitions, 53 changer transitions 17/164 dead transitions. [2025-03-04 02:19:00,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 164 transitions, 2093 flow [2025-03-04 02:19:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:19:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:19:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-04 02:19:00,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:19:00,466 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 1476 flow. Second operand 6 states and 108 transitions. [2025-03-04 02:19:00,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 164 transitions, 2093 flow [2025-03-04 02:19:00,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1978 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:00,617 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 1431 flow [2025-03-04 02:19:00,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1431, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2025-03-04 02:19:00,618 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 66 predicate places. [2025-03-04 02:19:00,618 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 1431 flow [2025-03-04 02:19:00,618 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-04 02:19:00,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:00,618 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-04 02:19:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:19:00,618 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-04 02:19:00,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -490733412, now seen corresponding path program 1 times [2025-03-04 02:19:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701078885] [2025-03-04 02:19:00,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:00,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:19:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:00,870 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-04 02:19:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701078885] [2025-03-04 02:19:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701078885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:00,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341554844] [2025-03-04 02:19:00,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:00,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:00,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:00,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:00,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 1431 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-04 02:19:00,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:00,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:00,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:02,170 INFO L124 PetriNetUnfolderBase]: 10533/15494 cut-off events. [2025-03-04 02:19:02,171 INFO L125 PetriNetUnfolderBase]: For 107304/107304 co-relation queries the response was YES. [2025-03-04 02:19:02,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65190 conditions, 15494 events. 10533/15494 cut-off events. For 107304/107304 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 93682 event pairs, 2910 based on Foata normal form. 13/15507 useless extension candidates. Maximal degree in co-relation 65151. Up to 4698 conditions per place. [2025-03-04 02:19:02,248 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 241 selfloop transitions, 24 changer transitions 1/267 dead transitions. [2025-03-04 02:19:02,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 267 transitions, 3882 flow [2025-03-04 02:19:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-03-04 02:19:02,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-04 02:19:02,249 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 1431 flow. Second operand 7 states and 142 transitions. [2025-03-04 02:19:02,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 267 transitions, 3882 flow [2025-03-04 02:19:02,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 267 transitions, 3636 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-04 02:19:02,525 INFO L231 Difference]: Finished difference. Result has 106 places, 118 transitions, 1647 flow [2025-03-04 02:19:02,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1647, PETRI_PLACES=106, PETRI_TRANSITIONS=118} [2025-03-04 02:19:02,525 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 71 predicate places. [2025-03-04 02:19:02,526 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 118 transitions, 1647 flow [2025-03-04 02:19:02,526 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-04 02:19:02,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:02,526 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-04 02:19:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:19:02,526 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-04 02:19:02,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2092539242, now seen corresponding path program 2 times [2025-03-04 02:19:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715447516] [2025-03-04 02:19:02,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:02,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:19:02,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:02,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:02,716 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-04 02:19:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715447516] [2025-03-04 02:19:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715447516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410834808] [2025-03-04 02:19:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:02,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:02,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:02,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:02,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 118 transitions, 1647 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-04 02:19:02,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:02,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:02,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:04,319 INFO L124 PetriNetUnfolderBase]: 12409/18250 cut-off events. [2025-03-04 02:19:04,319 INFO L125 PetriNetUnfolderBase]: For 123064/123064 co-relation queries the response was YES. [2025-03-04 02:19:04,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78163 conditions, 18250 events. 12409/18250 cut-off events. For 123064/123064 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 111996 event pairs, 2147 based on Foata normal form. 8/18258 useless extension candidates. Maximal degree in co-relation 78120. Up to 7652 conditions per place. [2025-03-04 02:19:04,411 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 185 selfloop transitions, 39 changer transitions 1/226 dead transitions. [2025-03-04 02:19:04,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 226 transitions, 2957 flow [2025-03-04 02:19:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2025-03-04 02:19:04,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2025-03-04 02:19:04,412 INFO L175 Difference]: Start difference. First operand has 106 places, 118 transitions, 1647 flow. Second operand 7 states and 130 transitions. [2025-03-04 02:19:04,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 226 transitions, 2957 flow [2025-03-04 02:19:04,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 226 transitions, 2925 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:04,718 INFO L231 Difference]: Finished difference. Result has 115 places, 129 transitions, 1950 flow [2025-03-04 02:19:04,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1950, PETRI_PLACES=115, PETRI_TRANSITIONS=129} [2025-03-04 02:19:04,718 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 80 predicate places. [2025-03-04 02:19:04,718 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 129 transitions, 1950 flow [2025-03-04 02:19:04,719 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-04 02:19:04,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:04,719 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-04 02:19:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:19:04,719 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-04 02:19:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1935467448, now seen corresponding path program 1 times [2025-03-04 02:19:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535926416] [2025-03-04 02:19:04,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:04,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:19:04,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:04,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:04,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:04,931 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-04 02:19:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535926416] [2025-03-04 02:19:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535926416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828297677] [2025-03-04 02:19:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:04,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:04,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:04,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:04,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:04,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 129 transitions, 1950 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-04 02:19:04,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:04,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:04,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:06,828 INFO L124 PetriNetUnfolderBase]: 14841/21920 cut-off events. [2025-03-04 02:19:06,830 INFO L125 PetriNetUnfolderBase]: For 166417/166417 co-relation queries the response was YES. [2025-03-04 02:19:06,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94815 conditions, 21920 events. 14841/21920 cut-off events. For 166417/166417 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 137383 event pairs, 2565 based on Foata normal form. 12/21932 useless extension candidates. Maximal degree in co-relation 94768. Up to 13109 conditions per place. [2025-03-04 02:19:06,972 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 220 selfloop transitions, 33 changer transitions 1/255 dead transitions. [2025-03-04 02:19:06,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 255 transitions, 3883 flow [2025-03-04 02:19:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-04 02:19:06,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2025-03-04 02:19:06,973 INFO L175 Difference]: Start difference. First operand has 115 places, 129 transitions, 1950 flow. Second operand 7 states and 121 transitions. [2025-03-04 02:19:06,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 255 transitions, 3883 flow [2025-03-04 02:19:07,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 255 transitions, 3763 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:07,670 INFO L231 Difference]: Finished difference. Result has 124 places, 144 transitions, 2266 flow [2025-03-04 02:19:07,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2266, PETRI_PLACES=124, PETRI_TRANSITIONS=144} [2025-03-04 02:19:07,671 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 89 predicate places. [2025-03-04 02:19:07,671 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 144 transitions, 2266 flow [2025-03-04 02:19:07,671 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-04 02:19:07,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:07,671 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-04 02:19:07,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:19:07,671 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-04 02:19:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1210456538, now seen corresponding path program 3 times [2025-03-04 02:19:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891471908] [2025-03-04 02:19:07,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:07,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:19:07,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-04 02:19:07,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:07,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:07,884 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-04 02:19:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:07,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891471908] [2025-03-04 02:19:07,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891471908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:07,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:07,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:07,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489114473] [2025-03-04 02:19:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:07,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:07,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:07,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:07,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 144 transitions, 2266 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-04 02:19:07,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:07,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:07,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:10,567 INFO L124 PetriNetUnfolderBase]: 15605/23184 cut-off events. [2025-03-04 02:19:10,568 INFO L125 PetriNetUnfolderBase]: For 189259/189259 co-relation queries the response was YES. [2025-03-04 02:19:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102888 conditions, 23184 events. 15605/23184 cut-off events. For 189259/189259 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 150326 event pairs, 2825 based on Foata normal form. 13/23197 useless extension candidates. Maximal degree in co-relation 102836. Up to 14378 conditions per place. [2025-03-04 02:19:10,749 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 261 selfloop transitions, 33 changer transitions 1/296 dead transitions. [2025-03-04 02:19:10,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 296 transitions, 4758 flow [2025-03-04 02:19:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-03-04 02:19:10,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-04 02:19:10,750 INFO L175 Difference]: Start difference. First operand has 124 places, 144 transitions, 2266 flow. Second operand 7 states and 129 transitions. [2025-03-04 02:19:10,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 296 transitions, 4758 flow [2025-03-04 02:19:11,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 296 transitions, 4698 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:11,607 INFO L231 Difference]: Finished difference. Result has 134 places, 161 transitions, 2662 flow [2025-03-04 02:19:11,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2229, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2662, PETRI_PLACES=134, PETRI_TRANSITIONS=161} [2025-03-04 02:19:11,608 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-03-04 02:19:11,608 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 161 transitions, 2662 flow [2025-03-04 02:19:11,608 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-04 02:19:11,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:11,608 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-04 02:19:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:19:11,608 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-04 02:19:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -969353786, now seen corresponding path program 4 times [2025-03-04 02:19:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478627858] [2025-03-04 02:19:11,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:11,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:19:11,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:11,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:11,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:11,729 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-04 02:19:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478627858] [2025-03-04 02:19:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478627858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:11,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:11,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:19:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96537104] [2025-03-04 02:19:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:11,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:11,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:19:11,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:11,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 161 transitions, 2662 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-04 02:19:11,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:11,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:11,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:14,139 INFO L124 PetriNetUnfolderBase]: 15584/23147 cut-off events. [2025-03-04 02:19:14,140 INFO L125 PetriNetUnfolderBase]: For 216088/216088 co-relation queries the response was YES. [2025-03-04 02:19:14,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106679 conditions, 23147 events. 15584/23147 cut-off events. For 216088/216088 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 149037 event pairs, 4808 based on Foata normal form. 13/23160 useless extension candidates. Maximal degree in co-relation 106622. Up to 7854 conditions per place. [2025-03-04 02:19:14,306 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 237 selfloop transitions, 46 changer transitions 1/285 dead transitions. [2025-03-04 02:19:14,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 285 transitions, 4552 flow [2025-03-04 02:19:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-04 02:19:14,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5436507936507936 [2025-03-04 02:19:14,307 INFO L175 Difference]: Start difference. First operand has 134 places, 161 transitions, 2662 flow. Second operand 7 states and 137 transitions. [2025-03-04 02:19:14,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 285 transitions, 4552 flow [2025-03-04 02:19:14,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 285 transitions, 4509 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:14,909 INFO L231 Difference]: Finished difference. Result has 143 places, 172 transitions, 3023 flow [2025-03-04 02:19:14,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3023, PETRI_PLACES=143, PETRI_TRANSITIONS=172} [2025-03-04 02:19:14,909 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 108 predicate places. [2025-03-04 02:19:14,909 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 172 transitions, 3023 flow [2025-03-04 02:19:14,910 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-04 02:19:14,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:14,910 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-04 02:19:14,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:19:14,910 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-04 02:19:14,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2106797460, now seen corresponding path program 5 times [2025-03-04 02:19:14,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19773194] [2025-03-04 02:19:14,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:14,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:19:14,941 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:14,943 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:14,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:15,197 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-04 02:19:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19773194] [2025-03-04 02:19:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19773194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817824712] [2025-03-04 02:19:15,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:15,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:19:15,270 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:19:15,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:15,293 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:19:15,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:15,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:19:15,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:15,460 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-04 02:19:15,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:15,573 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-04 02:19:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817824712] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2025-03-04 02:19:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125756913] [2025-03-04 02:19:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:15,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:15,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:15,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:15,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:15,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 172 transitions, 3023 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-04 02:19:15,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:15,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:15,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:19,070 INFO L124 PetriNetUnfolderBase]: 16054/23920 cut-off events. [2025-03-04 02:19:19,071 INFO L125 PetriNetUnfolderBase]: For 244325/244325 co-relation queries the response was YES. [2025-03-04 02:19:19,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111894 conditions, 23920 events. 16054/23920 cut-off events. For 244325/244325 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 155557 event pairs, 4516 based on Foata normal form. 26/23946 useless extension candidates. Maximal degree in co-relation 111833. Up to 8448 conditions per place. [2025-03-04 02:19:19,279 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 262 selfloop transitions, 59 changer transitions 1/323 dead transitions. [2025-03-04 02:19:19,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 323 transitions, 5422 flow [2025-03-04 02:19:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-03-04 02:19:19,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-03-04 02:19:19,280 INFO L175 Difference]: Start difference. First operand has 143 places, 172 transitions, 3023 flow. Second operand 7 states and 146 transitions. [2025-03-04 02:19:19,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 323 transitions, 5422 flow [2025-03-04 02:19:19,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 323 transitions, 5331 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:19,933 INFO L231 Difference]: Finished difference. Result has 151 places, 188 transitions, 3490 flow [2025-03-04 02:19:19,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3490, PETRI_PLACES=151, PETRI_TRANSITIONS=188} [2025-03-04 02:19:19,934 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 116 predicate places. [2025-03-04 02:19:19,934 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 188 transitions, 3490 flow [2025-03-04 02:19:19,934 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-04 02:19:19,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:19,934 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-04 02:19:19,940 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-04 02:19:20,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:19:20,135 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-04 02:19:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1018311860, now seen corresponding path program 2 times [2025-03-04 02:19:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982367285] [2025-03-04 02:19:20,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:20,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:19:20,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:20,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:20,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:20,403 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-04 02:19:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982367285] [2025-03-04 02:19:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982367285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:20,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:20,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293928900] [2025-03-04 02:19:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:20,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:20,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:20,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:20,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 188 transitions, 3490 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-04 02:19:20,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:20,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:23,302 INFO L124 PetriNetUnfolderBase]: 16482/24554 cut-off events. [2025-03-04 02:19:23,302 INFO L125 PetriNetUnfolderBase]: For 259897/259897 co-relation queries the response was YES. [2025-03-04 02:19:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116965 conditions, 24554 events. 16482/24554 cut-off events. For 259897/259897 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 159915 event pairs, 4917 based on Foata normal form. 12/24566 useless extension candidates. Maximal degree in co-relation 116900. Up to 9233 conditions per place. [2025-03-04 02:19:23,592 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 250 selfloop transitions, 72 changer transitions 1/324 dead transitions. [2025-03-04 02:19:23,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 324 transitions, 5694 flow [2025-03-04 02:19:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-03-04 02:19:23,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-03-04 02:19:23,593 INFO L175 Difference]: Start difference. First operand has 151 places, 188 transitions, 3490 flow. Second operand 7 states and 145 transitions. [2025-03-04 02:19:23,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 324 transitions, 5694 flow [2025-03-04 02:19:24,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 324 transitions, 5609 flow, removed 30 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:24,433 INFO L231 Difference]: Finished difference. Result has 159 places, 199 transitions, 3851 flow [2025-03-04 02:19:24,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3438, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3851, PETRI_PLACES=159, PETRI_TRANSITIONS=199} [2025-03-04 02:19:24,433 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 124 predicate places. [2025-03-04 02:19:24,433 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 199 transitions, 3851 flow [2025-03-04 02:19:24,434 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-04 02:19:24,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:24,434 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-04 02:19:24,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:19:24,434 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-04 02:19:24,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1879779574, now seen corresponding path program 6 times [2025-03-04 02:19:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049031882] [2025-03-04 02:19:24,434 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:24,443 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:19:24,455 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:24,455 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:24,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:24,881 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-04 02:19:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049031882] [2025-03-04 02:19:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049031882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873674877] [2025-03-04 02:19:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:24,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:24,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:24,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 199 transitions, 3851 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-04 02:19:24,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:24,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:24,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:28,663 INFO L124 PetriNetUnfolderBase]: 16456/24528 cut-off events. [2025-03-04 02:19:28,663 INFO L125 PetriNetUnfolderBase]: For 281321/281321 co-relation queries the response was YES. [2025-03-04 02:19:28,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118290 conditions, 24528 events. 16456/24528 cut-off events. For 281321/281321 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 160290 event pairs, 4796 based on Foata normal form. 26/24554 useless extension candidates. Maximal degree in co-relation 118222. Up to 8448 conditions per place. [2025-03-04 02:19:28,826 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 253 selfloop transitions, 75 changer transitions 1/330 dead transitions. [2025-03-04 02:19:28,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 330 transitions, 5922 flow [2025-03-04 02:19:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-04 02:19:28,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:19:28,827 INFO L175 Difference]: Start difference. First operand has 159 places, 199 transitions, 3851 flow. Second operand 7 states and 147 transitions. [2025-03-04 02:19:28,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 330 transitions, 5922 flow [2025-03-04 02:19:29,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 330 transitions, 5809 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:29,623 INFO L231 Difference]: Finished difference. Result has 166 places, 204 transitions, 4070 flow [2025-03-04 02:19:29,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3759, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4070, PETRI_PLACES=166, PETRI_TRANSITIONS=204} [2025-03-04 02:19:29,624 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 131 predicate places. [2025-03-04 02:19:29,624 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 204 transitions, 4070 flow [2025-03-04 02:19:29,624 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-04 02:19:29,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:29,624 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-04 02:19:29,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:19:29,624 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-04 02:19:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1844259226, now seen corresponding path program 3 times [2025-03-04 02:19:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044056973] [2025-03-04 02:19:29,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:29,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:19:29,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-03-04 02:19:29,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:29,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:29,861 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-04 02:19:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044056973] [2025-03-04 02:19:29,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044056973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:29,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:29,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434130014] [2025-03-04 02:19:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:29,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:29,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:29,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:29,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:29,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 204 transitions, 4070 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-04 02:19:29,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:29,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:29,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:32,858 INFO L124 PetriNetUnfolderBase]: 16968/25301 cut-off events. [2025-03-04 02:19:32,858 INFO L125 PetriNetUnfolderBase]: For 305926/305926 co-relation queries the response was YES. [2025-03-04 02:19:33,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123342 conditions, 25301 events. 16968/25301 cut-off events. For 305926/305926 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 166142 event pairs, 6044 based on Foata normal form. 12/25313 useless extension candidates. Maximal degree in co-relation 123271. Up to 14737 conditions per place. [2025-03-04 02:19:33,091 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 237 selfloop transitions, 83 changer transitions 1/322 dead transitions. [2025-03-04 02:19:33,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 322 transitions, 5983 flow [2025-03-04 02:19:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-03-04 02:19:33,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:19:33,092 INFO L175 Difference]: Start difference. First operand has 166 places, 204 transitions, 4070 flow. Second operand 7 states and 144 transitions. [2025-03-04 02:19:33,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 322 transitions, 5983 flow [2025-03-04 02:19:34,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 322 transitions, 5849 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:34,374 INFO L231 Difference]: Finished difference. Result has 172 places, 224 transitions, 4681 flow [2025-03-04 02:19:34,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3944, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4681, PETRI_PLACES=172, PETRI_TRANSITIONS=224} [2025-03-04 02:19:34,374 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 137 predicate places. [2025-03-04 02:19:34,374 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 224 transitions, 4681 flow [2025-03-04 02:19:34,374 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-04 02:19:34,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:34,374 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-04 02:19:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:19:34,374 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-04 02:19:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash -591607614, now seen corresponding path program 7 times [2025-03-04 02:19:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446722358] [2025-03-04 02:19:34,375 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:19:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:19:34,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:34,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:34,642 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-04 02:19:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446722358] [2025-03-04 02:19:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446722358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:19:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839947795] [2025-03-04 02:19:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:19:34,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-03-04 02:19:34,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 224 transitions, 4681 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-04 02:19:34,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:34,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-03-04 02:19:34,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand