./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.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-array-int-symm.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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:17:41,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:17:41,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:17:41,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:17:41,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:17:41,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:17:41,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:17:41,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:17:41,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:17:41,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:17:41,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:17:41,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:17:41,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:17:41,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:17:41,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:17:41,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:17:41,953 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-04 02:17:42,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:17:42,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:17:42,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:17:42,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:17:42,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:17:42,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 02:17:43,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e5d2856/0a33a24cd7a54d84b4c53c6bb2377acc/FLAG83f8deb29 [2025-03-04 02:17:43,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:17:43,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 02:17:43,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e5d2856/0a33a24cd7a54d84b4c53c6bb2377acc/FLAG83f8deb29 [2025-03-04 02:17:43,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e5d2856/0a33a24cd7a54d84b4c53c6bb2377acc [2025-03-04 02:17:43,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:17:43,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:17:43,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:17:43,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:17:43,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:17:43,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eec5165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43, skipping insertion in model container [2025-03-04 02:17:43,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:17:43,852 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-array-int-symm.wvr.c[2508,2521] [2025-03-04 02:17:43,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:17:43,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:17:43,879 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-array-int-symm.wvr.c[2508,2521] [2025-03-04 02:17:43,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:17:43,892 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:17:43,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43 WrapperNode [2025-03-04 02:17:43,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:17:43,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:17:43,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:17:43,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:17:43,898 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:17:43" (1/1) ... [2025-03-04 02:17:43,904 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:17:43" (1/1) ... [2025-03-04 02:17:43,917 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 181 [2025-03-04 02:17:43,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:17:43,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:17:43,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:17:43,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:17:43,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,933 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 02:17:43,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:17:43,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:17:43,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:17:43,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:17:43,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (1/1) ... [2025-03-04 02:17:43,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:17:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:43,961 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:17:43,965 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:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:17:43,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:17:43,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:17:43,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:17:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:17:43,980 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:17:44,056 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:17:44,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:17:44,330 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:17:44,330 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:17:44,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:17:44,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:17:44,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:17:44 BoogieIcfgContainer [2025-03-04 02:17:44,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:17:44,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:17:44,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:17:44,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:17:44,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:17:43" (1/3) ... [2025-03-04 02:17:44,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619623c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:17:44, skipping insertion in model container [2025-03-04 02:17:44,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:17:43" (2/3) ... [2025-03-04 02:17:44,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619623c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:17:44, skipping insertion in model container [2025-03-04 02:17:44,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:17:44" (3/3) ... [2025-03-04 02:17:44,517 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-04 02:17:44,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:17:44,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:17:44,529 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:17:44,568 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:17:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:17:44,617 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:17:44,621 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:17:44,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-04 02:17:44,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:17:44,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-03-04 02:17:44,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:17:44,639 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;@4d21bd70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:17:44,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:17:44,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:17:44,651 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-03-04 02:17:44,651 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:17:44,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:44,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:44,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1347315461, now seen corresponding path program 1 times [2025-03-04 02:17:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:44,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733349468] [2025-03-04 02:17:44,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:44,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:17:44,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:17:44,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:45,188 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:17:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733349468] [2025-03-04 02:17:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733349468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:45,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:17:45,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080899882] [2025-03-04 02:17:45,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:45,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:45,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:17:45,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:45,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:17:45,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:45,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:45,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:45,477 INFO L124 PetriNetUnfolderBase]: 230/408 cut-off events. [2025-03-04 02:17:45,478 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 02:17:45,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 408 events. 230/408 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1587 event pairs, 64 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2025-03-04 02:17:45,484 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 58 selfloop transitions, 10 changer transitions 1/72 dead transitions. [2025-03-04 02:17:45,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 72 transitions, 324 flow [2025-03-04 02:17:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:17:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:17:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-04 02:17:45,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-03-04 02:17:45,495 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 8 states and 110 transitions. [2025-03-04 02:17:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 72 transitions, 324 flow [2025-03-04 02:17:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:45,500 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 123 flow [2025-03-04 02:17:45,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-03-04 02:17:45,503 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-04 02:17:45,503 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 123 flow [2025-03-04 02:17:45,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:17:45,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:45,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:45,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:17:45,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:45,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2132697743, now seen corresponding path program 1 times [2025-03-04 02:17:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330069836] [2025-03-04 02:17:45,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:45,656 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:17:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330069836] [2025-03-04 02:17:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330069836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330450690] [2025-03-04 02:17:45,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:45,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:45,659 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:17:45,660 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:17:45,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:45,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:45,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:45,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:17:45,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:45,862 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:17:45,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330450690] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-04 02:17:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536261981] [2025-03-04 02:17:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:45,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:17:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:17:45,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:17:45,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:45,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 123 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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:17:45,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:45,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:45,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:46,279 INFO L124 PetriNetUnfolderBase]: 495/876 cut-off events. [2025-03-04 02:17:46,280 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 02:17:46,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 876 events. 495/876 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4235 event pairs, 218 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 1177. Up to 394 conditions per place. [2025-03-04 02:17:46,287 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 83 selfloop transitions, 12 changer transitions 1/99 dead transitions. [2025-03-04 02:17:46,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 99 transitions, 508 flow [2025-03-04 02:17:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:17:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:17:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-03-04 02:17:46,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:17:46,290 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 123 flow. Second operand 8 states and 126 transitions. [2025-03-04 02:17:46,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 99 transitions, 508 flow [2025-03-04 02:17:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 99 transitions, 504 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:17:46,294 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 210 flow [2025-03-04 02:17:46,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-03-04 02:17:46,295 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-03-04 02:17:46,295 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 210 flow [2025-03-04 02:17:46,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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:17:46,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:46,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:46,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:46,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:46,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:46,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1394888682, now seen corresponding path program 1 times [2025-03-04 02:17:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:46,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631331593] [2025-03-04 02:17:46,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:46,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:46,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:46,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:46,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:46,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:46,566 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:17:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:46,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631331593] [2025-03-04 02:17:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631331593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:17:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319688439] [2025-03-04 02:17:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:46,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:17:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:17:46,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:17:46,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:46,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:46,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:46,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:46,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:46,692 INFO L124 PetriNetUnfolderBase]: 372/703 cut-off events. [2025-03-04 02:17:46,692 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-03-04 02:17:46,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 703 events. 372/703 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3428 event pairs, 157 based on Foata normal form. 25/725 useless extension candidates. Maximal degree in co-relation 1257. Up to 425 conditions per place. [2025-03-04 02:17:46,696 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 58 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-03-04 02:17:46,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 431 flow [2025-03-04 02:17:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-04 02:17:46,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-04 02:17:46,699 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 210 flow. Second operand 5 states and 73 transitions. [2025-03-04 02:17:46,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 431 flow [2025-03-04 02:17:46,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 410 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:17:46,702 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 212 flow [2025-03-04 02:17:46,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-04 02:17:46,703 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-04 02:17:46,703 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 212 flow [2025-03-04 02:17:46,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:46,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:46,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:17:46,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -208855790, now seen corresponding path program 1 times [2025-03-04 02:17:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113234396] [2025-03-04 02:17:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:46,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:46,790 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:17:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113234396] [2025-03-04 02:17:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113234396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:46,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:17:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41491224] [2025-03-04 02:17:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:46,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:17:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:46,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:17:46,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:17:46,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:46,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:46,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:46,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:46,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:46,894 INFO L124 PetriNetUnfolderBase]: 303/578 cut-off events. [2025-03-04 02:17:46,895 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-04 02:17:46,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 578 events. 303/578 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2660 event pairs, 142 based on Foata normal form. 16/592 useless extension candidates. Maximal degree in co-relation 1330. Up to 421 conditions per place. [2025-03-04 02:17:46,897 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 49 selfloop transitions, 5 changer transitions 2/59 dead transitions. [2025-03-04 02:17:46,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 389 flow [2025-03-04 02:17:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-03-04 02:17:46,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-04 02:17:46,898 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 212 flow. Second operand 5 states and 68 transitions. [2025-03-04 02:17:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 389 flow [2025-03-04 02:17:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 372 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:46,900 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 220 flow [2025-03-04 02:17:46,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-04 02:17:46,901 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-04 02:17:46,901 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 220 flow [2025-03-04 02:17:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:46,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:46,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:17:46,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:46,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1144005200, now seen corresponding path program 1 times [2025-03-04 02:17:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013961294] [2025-03-04 02:17:46,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:46,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:47,019 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:17:47,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:47,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013961294] [2025-03-04 02:17:47,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013961294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:47,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422143544] [2025-03-04 02:17:47,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:47,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:47,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:47,023 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:17:47,024 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:17:47,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:17:47,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:17:47,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:47,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:47,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:17:47,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:47,192 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:17:47,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422143544] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:17:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217279137] [2025-03-04 02:17:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:47,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:47,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:17:47,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:47,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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:17:47,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:47,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:47,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:47,432 INFO L124 PetriNetUnfolderBase]: 286/540 cut-off events. [2025-03-04 02:17:47,432 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2025-03-04 02:17:47,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 540 events. 286/540 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2486 event pairs, 138 based on Foata normal form. 1/537 useless extension candidates. Maximal degree in co-relation 1389. Up to 421 conditions per place. [2025-03-04 02:17:47,435 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 46 selfloop transitions, 5 changer transitions 7/61 dead transitions. [2025-03-04 02:17:47,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 393 flow [2025-03-04 02:17:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-03-04 02:17:47,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2025-03-04 02:17:47,437 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 220 flow. Second operand 7 states and 83 transitions. [2025-03-04 02:17:47,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 393 flow [2025-03-04 02:17:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 380 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:47,440 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 205 flow [2025-03-04 02:17:47,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-03-04 02:17:47,441 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-04 02:17:47,441 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 205 flow [2025-03-04 02:17:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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:17:47,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:47,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:47,447 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:17:47,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:47,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1132307270, now seen corresponding path program 2 times [2025-03-04 02:17:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970930830] [2025-03-04 02:17:47,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:47,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:17:47,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:17:47,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:17:47,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970930830] [2025-03-04 02:17:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970930830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:17:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351184538] [2025-03-04 02:17:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:47,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:47,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:47,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:47,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:47,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:17:47,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:47,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:47,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:47,876 INFO L124 PetriNetUnfolderBase]: 275/511 cut-off events. [2025-03-04 02:17:47,877 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-03-04 02:17:47,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 511 events. 275/511 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2255 event pairs, 62 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1314. Up to 406 conditions per place. [2025-03-04 02:17:47,879 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 31 selfloop transitions, 5 changer transitions 20/59 dead transitions. [2025-03-04 02:17:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 370 flow [2025-03-04 02:17:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-03-04 02:17:47,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2025-03-04 02:17:47,880 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 205 flow. Second operand 7 states and 83 transitions. [2025-03-04 02:17:47,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 370 flow [2025-03-04 02:17:47,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 359 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:47,882 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 175 flow [2025-03-04 02:17:47,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2025-03-04 02:17:47,882 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2025-03-04 02:17:47,882 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 175 flow [2025-03-04 02:17:47,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:17:47,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:47,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:17:47,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -612047067, now seen corresponding path program 2 times [2025-03-04 02:17:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621474761] [2025-03-04 02:17:47,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:47,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:17:47,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:17:47,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:17:47,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621474761] [2025-03-04 02:17:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621474761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:17:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077883771] [2025-03-04 02:17:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:17:48,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:48,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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:17:48,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:48,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:48,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:48,185 INFO L124 PetriNetUnfolderBase]: 272/498 cut-off events. [2025-03-04 02:17:48,186 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2025-03-04 02:17:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 498 events. 272/498 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2155 event pairs, 34 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 1278. Up to 146 conditions per place. [2025-03-04 02:17:48,188 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 59 selfloop transitions, 15 changer transitions 1/78 dead transitions. [2025-03-04 02:17:48,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 463 flow [2025-03-04 02:17:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-03-04 02:17:48,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-04 02:17:48,188 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 175 flow. Second operand 9 states and 118 transitions. [2025-03-04 02:17:48,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 463 flow [2025-03-04 02:17:48,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 78 transitions, 415 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-03-04 02:17:48,190 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 235 flow [2025-03-04 02:17:48,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-04 02:17:48,191 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-04 02:17:48,191 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 235 flow [2025-03-04 02:17:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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:17:48,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:48,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:48,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:17:48,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1949246662, now seen corresponding path program 1 times [2025-03-04 02:17:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762894575] [2025-03-04 02:17:48,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:48,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:17:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:17:48,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:48,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:48,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762894575] [2025-03-04 02:17:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762894575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:17:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570306257] [2025-03-04 02:17:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:48,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:17:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:48,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:17:48,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:17:48,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:48,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:17:48,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:48,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:48,314 INFO L124 PetriNetUnfolderBase]: 170/328 cut-off events. [2025-03-04 02:17:48,314 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-04 02:17:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 328 events. 170/328 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1335 event pairs, 67 based on Foata normal form. 20/346 useless extension candidates. Maximal degree in co-relation 864. Up to 158 conditions per place. [2025-03-04 02:17:48,315 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 46 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-03-04 02:17:48,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 348 flow [2025-03-04 02:17:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-04 02:17:48,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-04 02:17:48,316 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 235 flow. Second operand 5 states and 72 transitions. [2025-03-04 02:17:48,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 348 flow [2025-03-04 02:17:48,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 332 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:48,318 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 202 flow [2025-03-04 02:17:48,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-04 02:17:48,319 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-03-04 02:17:48,319 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 202 flow [2025-03-04 02:17:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:17:48,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:48,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:17:48,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:48,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash -822119130, now seen corresponding path program 1 times [2025-03-04 02:17:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462560493] [2025-03-04 02:17:48,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:48,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:17:48,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:17:48,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:48,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462560493] [2025-03-04 02:17:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462560493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277005924] [2025-03-04 02:17:48,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:48,426 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:17:48,428 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:17:48,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:17:48,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:17:48,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:48,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:48,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:17:48,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:48,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277005924] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:48,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:48,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:17:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824945011] [2025-03-04 02:17:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:48,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:48,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:48,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:17:48,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:17:48,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:17:48,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:48,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:17:48,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:48,754 INFO L124 PetriNetUnfolderBase]: 243/437 cut-off events. [2025-03-04 02:17:48,754 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-03-04 02:17:48,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 437 events. 243/437 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1761 event pairs, 86 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1164. Up to 129 conditions per place. [2025-03-04 02:17:48,756 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 51 selfloop transitions, 11 changer transitions 3/67 dead transitions. [2025-03-04 02:17:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 427 flow [2025-03-04 02:17:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:17:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:17:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2025-03-04 02:17:48,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-03-04 02:17:48,757 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 202 flow. Second operand 8 states and 91 transitions. [2025-03-04 02:17:48,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 427 flow [2025-03-04 02:17:48,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 417 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:48,759 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 229 flow [2025-03-04 02:17:48,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-04 02:17:48,759 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2025-03-04 02:17:48,759 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 229 flow [2025-03-04 02:17:48,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:17:48,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:48,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:48,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:48,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -167561326, now seen corresponding path program 1 times [2025-03-04 02:17:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534563568] [2025-03-04 02:17:48,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:17:48,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:17:48,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:48,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534563568] [2025-03-04 02:17:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534563568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:17:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693771710] [2025-03-04 02:17:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:49,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:17:49,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:49,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:17:49,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:17:49,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:49,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:17:49,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:49,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:49,077 INFO L124 PetriNetUnfolderBase]: 166/327 cut-off events. [2025-03-04 02:17:49,077 INFO L125 PetriNetUnfolderBase]: For 397/398 co-relation queries the response was YES. [2025-03-04 02:17:49,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 327 events. 166/327 cut-off events. For 397/398 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1261 event pairs, 93 based on Foata normal form. 12/337 useless extension candidates. Maximal degree in co-relation 910. Up to 233 conditions per place. [2025-03-04 02:17:49,079 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 25 selfloop transitions, 2 changer transitions 16/46 dead transitions. [2025-03-04 02:17:49,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 298 flow [2025-03-04 02:17:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:17:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:17:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:17:49,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-04 02:17:49,079 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 229 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:17:49,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 298 flow [2025-03-04 02:17:49,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 277 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 02:17:49,081 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 128 flow [2025-03-04 02:17:49,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2025-03-04 02:17:49,081 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-04 02:17:49,081 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 128 flow [2025-03-04 02:17:49,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:17:49,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:49,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:49,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:17:49,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -738742195, now seen corresponding path program 1 times [2025-03-04 02:17:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-03-04 02:17:49,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:49,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:17:49,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:17:49,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:49,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:49,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:49,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144618966] [2025-03-04 02:17:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144618966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:49,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279733701] [2025-03-04 02:17:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:49,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:49,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:49,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:17:49,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:17:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:17:49,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:17:49,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:49,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:49,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:17:49,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:49,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279733701] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:17:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987257009] [2025-03-04 02:17:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:49,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:49,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:49,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:17:49,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:17:49,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:17:49,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:49,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:17:49,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:49,455 INFO L124 PetriNetUnfolderBase]: 201/374 cut-off events. [2025-03-04 02:17:49,455 INFO L125 PetriNetUnfolderBase]: For 295/297 co-relation queries the response was YES. [2025-03-04 02:17:49,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 374 events. 201/374 cut-off events. For 295/297 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1358 event pairs, 100 based on Foata normal form. 16/387 useless extension candidates. Maximal degree in co-relation 993. Up to 190 conditions per place. [2025-03-04 02:17:49,457 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2025-03-04 02:17:49,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 266 flow [2025-03-04 02:17:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2025-03-04 02:17:49,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2025-03-04 02:17:49,457 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 128 flow. Second operand 7 states and 67 transitions. [2025-03-04 02:17:49,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 266 flow [2025-03-04 02:17:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 245 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 02:17:49,458 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 144 flow [2025-03-04 02:17:49,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-04 02:17:49,459 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-04 02:17:49,459 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 144 flow [2025-03-04 02:17:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:17:49,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:49,459 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] [2025-03-04 02:17:49,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:49,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:49,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:49,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1496546592, now seen corresponding path program 1 times [2025-03-04 02:17:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929287733] [2025-03-04 02:17:49,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:49,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:17:49,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:49,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:49,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:50,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929287733] [2025-03-04 02:17:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929287733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529285414] [2025-03-04 02:17:50,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:50,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:17:50,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:17:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:17:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:50,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:50,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:50,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:50,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:50,188 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:17:50,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 24 [2025-03-04 02:17:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:50,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:17:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529285414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:50,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:17:50,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-04 02:17:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301767702] [2025-03-04 02:17:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:50,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:17:50,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:50,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 144 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:17:50,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:50,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:50,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:50,405 INFO L124 PetriNetUnfolderBase]: 274/512 cut-off events. [2025-03-04 02:17:50,406 INFO L125 PetriNetUnfolderBase]: For 510/529 co-relation queries the response was YES. [2025-03-04 02:17:50,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 512 events. 274/512 cut-off events. For 510/529 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2236 event pairs, 101 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 1452. Up to 279 conditions per place. [2025-03-04 02:17:50,408 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 59 selfloop transitions, 7 changer transitions 6/75 dead transitions. [2025-03-04 02:17:50,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 450 flow [2025-03-04 02:17:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-04 02:17:50,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-04 02:17:50,409 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 144 flow. Second operand 7 states and 100 transitions. [2025-03-04 02:17:50,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 450 flow [2025-03-04 02:17:50,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:50,411 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 192 flow [2025-03-04 02:17:50,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2025-03-04 02:17:50,413 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-04 02:17:50,413 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 192 flow [2025-03-04 02:17:50,413 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:17:50,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:50,413 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] [2025-03-04 02:17:50,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:17:50,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] === [2025-03-04 02:17:50,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1773613190, now seen corresponding path program 2 times [2025-03-04 02:17:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460464182] [2025-03-04 02:17:50,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:50,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:50,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 02:17:50,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:17:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460464182] [2025-03-04 02:17:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460464182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:17:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375367435] [2025-03-04 02:17:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:17:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:50,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:17:50,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:17:50,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:50,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 192 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:17:50,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:50,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:51,077 INFO L124 PetriNetUnfolderBase]: 321/597 cut-off events. [2025-03-04 02:17:51,077 INFO L125 PetriNetUnfolderBase]: For 1045/1068 co-relation queries the response was YES. [2025-03-04 02:17:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 597 events. 321/597 cut-off events. For 1045/1068 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2693 event pairs, 64 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 1935. Up to 275 conditions per place. [2025-03-04 02:17:51,080 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 52 selfloop transitions, 13 changer transitions 6/74 dead transitions. [2025-03-04 02:17:51,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 497 flow [2025-03-04 02:17:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2025-03-04 02:17:51,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-03-04 02:17:51,081 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 192 flow. Second operand 9 states and 111 transitions. [2025-03-04 02:17:51,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 497 flow [2025-03-04 02:17:51,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 468 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:51,083 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 262 flow [2025-03-04 02:17:51,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-03-04 02:17:51,083 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2025-03-04 02:17:51,084 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 262 flow [2025-03-04 02:17:51,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:17:51,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:51,084 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] [2025-03-04 02:17:51,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:17:51,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1201577342, now seen corresponding path program 3 times [2025-03-04 02:17:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593604910] [2025-03-04 02:17:51,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:51,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:51,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 02:17:51,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:17:51,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593604910] [2025-03-04 02:17:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593604910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:17:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043618772] [2025-03-04 02:17:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:17:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:17:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:17:51,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:51,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 262 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:17:51,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:51,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:51,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:51,479 INFO L124 PetriNetUnfolderBase]: 312/575 cut-off events. [2025-03-04 02:17:51,479 INFO L125 PetriNetUnfolderBase]: For 1415/1438 co-relation queries the response was YES. [2025-03-04 02:17:51,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 575 events. 312/575 cut-off events. For 1415/1438 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2520 event pairs, 59 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 1994. Up to 275 conditions per place. [2025-03-04 02:17:51,482 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 50 selfloop transitions, 14 changer transitions 6/73 dead transitions. [2025-03-04 02:17:51,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 530 flow [2025-03-04 02:17:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-04 02:17:51,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-03-04 02:17:51,483 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 262 flow. Second operand 9 states and 109 transitions. [2025-03-04 02:17:51,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 530 flow [2025-03-04 02:17:51,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 510 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:51,485 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 314 flow [2025-03-04 02:17:51,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-03-04 02:17:51,485 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-03-04 02:17:51,485 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 314 flow [2025-03-04 02:17:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:17:51,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:51,486 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] [2025-03-04 02:17:51,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:17:51,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:51,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -73075014, now seen corresponding path program 4 times [2025-03-04 02:17:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701941671] [2025-03-04 02:17:51,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:51,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:51,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:51,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:51,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701941671] [2025-03-04 02:17:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701941671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:17:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504415286] [2025-03-04 02:17:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:51,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:17:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:51,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:17:51,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:17:51,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:17:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:51,829 INFO L124 PetriNetUnfolderBase]: 418/769 cut-off events. [2025-03-04 02:17:51,829 INFO L125 PetriNetUnfolderBase]: For 2086/2113 co-relation queries the response was YES. [2025-03-04 02:17:51,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 769 events. 418/769 cut-off events. For 2086/2113 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3607 event pairs, 92 based on Foata normal form. 1/766 useless extension candidates. Maximal degree in co-relation 2732. Up to 400 conditions per place. [2025-03-04 02:17:51,833 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 56 selfloop transitions, 15 changer transitions 6/80 dead transitions. [2025-03-04 02:17:51,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 677 flow [2025-03-04 02:17:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:17:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:17:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-03-04 02:17:51,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4419642857142857 [2025-03-04 02:17:51,834 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 314 flow. Second operand 8 states and 99 transitions. [2025-03-04 02:17:51,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 677 flow [2025-03-04 02:17:51,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 632 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 02:17:51,837 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 377 flow [2025-03-04 02:17:51,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=377, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-03-04 02:17:51,837 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-04 02:17:51,837 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 377 flow [2025-03-04 02:17:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:17:51,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:51,838 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] [2025-03-04 02:17:51,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:17:51,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1158193042, now seen corresponding path program 5 times [2025-03-04 02:17:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513778187] [2025-03-04 02:17:51,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:51,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:51,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:51,852 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:51,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513778187] [2025-03-04 02:17:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513778187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870391619] [2025-03-04 02:17:52,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:52,112 INFO L229 MonitoredProcess]: Starting monitored process 7 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:17:52,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:17:52,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:52,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:52,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:52,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:52,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:17:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:52,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:17:52,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:17:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:52,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:17:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870391619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:17:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-04 02:17:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348238214] [2025-03-04 02:17:52,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:52,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:52,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:52,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:17:52,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:52,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 377 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:52,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:52,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:52,570 INFO L124 PetriNetUnfolderBase]: 414/765 cut-off events. [2025-03-04 02:17:52,570 INFO L125 PetriNetUnfolderBase]: For 2643/2670 co-relation queries the response was YES. [2025-03-04 02:17:52,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 765 events. 414/765 cut-off events. For 2643/2670 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3574 event pairs, 160 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 2871. Up to 404 conditions per place. [2025-03-04 02:17:52,574 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 56 selfloop transitions, 19 changer transitions 6/84 dead transitions. [2025-03-04 02:17:52,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 728 flow [2025-03-04 02:17:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-04 02:17:52,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:17:52,577 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 377 flow. Second operand 9 states and 108 transitions. [2025-03-04 02:17:52,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 728 flow [2025-03-04 02:17:52,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 711 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:17:52,580 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 509 flow [2025-03-04 02:17:52,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=509, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2025-03-04 02:17:52,581 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2025-03-04 02:17:52,581 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 509 flow [2025-03-04 02:17:52,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:52,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:52,581 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] [2025-03-04 02:17:52,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:52,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:17:52,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1274055742, now seen corresponding path program 6 times [2025-03-04 02:17:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:52,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-03-04 02:17:52,785 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:17:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:52,792 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:52,802 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 02:17:52,803 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:17:52,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-03-04 02:17:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093798595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:17:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611008756] [2025-03-04 02:17:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:53,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:17:53,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:53,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 509 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:53,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:53,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:53,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:53,260 INFO L124 PetriNetUnfolderBase]: 417/771 cut-off events. [2025-03-04 02:17:53,260 INFO L125 PetriNetUnfolderBase]: For 3755/3782 co-relation queries the response was YES. [2025-03-04 02:17:53,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 771 events. 417/771 cut-off events. For 3755/3782 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3592 event pairs, 165 based on Foata normal form. 1/767 useless extension candidates. Maximal degree in co-relation 3133. Up to 404 conditions per place. [2025-03-04 02:17:53,263 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 57 selfloop transitions, 21 changer transitions 6/87 dead transitions. [2025-03-04 02:17:53,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 850 flow [2025-03-04 02:17:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-04 02:17:53,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-03-04 02:17:53,264 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 509 flow. Second operand 9 states and 109 transitions. [2025-03-04 02:17:53,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 850 flow [2025-03-04 02:17:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 813 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:53,270 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 598 flow [2025-03-04 02:17:53,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=598, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2025-03-04 02:17:53,271 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 55 predicate places. [2025-03-04 02:17:53,271 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 598 flow [2025-03-04 02:17:53,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:53,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:53,271 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] [2025-03-04 02:17:53,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:17:53,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1469488570, now seen corresponding path program 7 times [2025-03-04 02:17:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754309175] [2025-03-04 02:17:53,272 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:17:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:53,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:17:53,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:53,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:53,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754309175] [2025-03-04 02:17:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754309175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589556261] [2025-03-04 02:17:53,626 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:17:53,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:53,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:53,628 INFO L229 MonitoredProcess]: Starting monitored process 8 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:17:53,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:17:53,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:17:53,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:17:53,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:53,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:53,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:53,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:53,768 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:17:53,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 24 [2025-03-04 02:17:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:53,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:17:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589556261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:17:53,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2025-03-04 02:17:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235505047] [2025-03-04 02:17:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:53,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:53,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:17:53,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:53,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 598 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:17:53,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:53,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:53,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:53,985 INFO L124 PetriNetUnfolderBase]: 446/821 cut-off events. [2025-03-04 02:17:53,985 INFO L125 PetriNetUnfolderBase]: For 4593/4620 co-relation queries the response was YES. [2025-03-04 02:17:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 821 events. 446/821 cut-off events. For 4593/4620 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3883 event pairs, 168 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 3559. Up to 420 conditions per place. [2025-03-04 02:17:53,989 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 69 selfloop transitions, 23 changer transitions 6/101 dead transitions. [2025-03-04 02:17:53,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 1146 flow [2025-03-04 02:17:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-04 02:17:53,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-04 02:17:53,990 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 598 flow. Second operand 7 states and 96 transitions. [2025-03-04 02:17:53,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 1146 flow [2025-03-04 02:17:53,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 1089 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:53,996 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 754 flow [2025-03-04 02:17:53,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=754, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2025-03-04 02:17:53,997 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 59 predicate places. [2025-03-04 02:17:53,997 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 754 flow [2025-03-04 02:17:53,997 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:17:53,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:53,997 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] [2025-03-04 02:17:54,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:54,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1171847534, now seen corresponding path program 8 times [2025-03-04 02:17:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375096776] [2025-03-04 02:17:54,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:54,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:17:54,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 02:17:54,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:17:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375096776] [2025-03-04 02:17:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375096776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:17:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600411683] [2025-03-04 02:17:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:54,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:54,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:17:54,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:54,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 754 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:54,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:54,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:54,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:54,696 INFO L124 PetriNetUnfolderBase]: 437/798 cut-off events. [2025-03-04 02:17:54,696 INFO L125 PetriNetUnfolderBase]: For 4586/4613 co-relation queries the response was YES. [2025-03-04 02:17:54,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 798 events. 437/798 cut-off events. For 4586/4613 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3729 event pairs, 164 based on Foata normal form. 1/792 useless extension candidates. Maximal degree in co-relation 3617. Up to 413 conditions per place. [2025-03-04 02:17:54,700 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 57 selfloop transitions, 29 changer transitions 6/95 dead transitions. [2025-03-04 02:17:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 1097 flow [2025-03-04 02:17:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-04 02:17:54,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-03-04 02:17:54,701 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 754 flow. Second operand 9 states and 109 transitions. [2025-03-04 02:17:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 1097 flow [2025-03-04 02:17:54,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 1037 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:54,708 INFO L231 Difference]: Finished difference. Result has 91 places, 67 transitions, 801 flow [2025-03-04 02:17:54,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=91, PETRI_TRANSITIONS=67} [2025-03-04 02:17:54,709 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 65 predicate places. [2025-03-04 02:17:54,709 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 67 transitions, 801 flow [2025-03-04 02:17:54,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:54,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:54,709 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:17:54,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:17:54,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -336730309, now seen corresponding path program 1 times [2025-03-04 02:17:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:54,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-04 02:17:54,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:54,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:17:54,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:54,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:54,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-04 02:17:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210374209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670092978] [2025-03-04 02:17:54,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:54,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:54,905 INFO L229 MonitoredProcess]: Starting monitored process 9 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:17:54,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:17:54,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:17:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:54,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:54,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:17:54,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:55,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:55,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 02:17:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:55,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:55,113 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:17:55,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:17:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670092978] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-04 02:17:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507121177] [2025-03-04 02:17:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:55,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:55,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:55,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:17:55,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 67 transitions, 801 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:17:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:55,365 INFO L124 PetriNetUnfolderBase]: 494/904 cut-off events. [2025-03-04 02:17:55,365 INFO L125 PetriNetUnfolderBase]: For 4893/4928 co-relation queries the response was YES. [2025-03-04 02:17:55,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4162 conditions, 904 events. 494/904 cut-off events. For 4893/4928 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4472 event pairs, 149 based on Foata normal form. 10/912 useless extension candidates. Maximal degree in co-relation 4113. Up to 429 conditions per place. [2025-03-04 02:17:55,370 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 86 selfloop transitions, 30 changer transitions 0/119 dead transitions. [2025-03-04 02:17:55,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 119 transitions, 1397 flow [2025-03-04 02:17:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-03-04 02:17:55,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 02:17:55,371 INFO L175 Difference]: Start difference. First operand has 91 places, 67 transitions, 801 flow. Second operand 7 states and 105 transitions. [2025-03-04 02:17:55,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 119 transitions, 1397 flow [2025-03-04 02:17:55,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 1336 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:55,379 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 980 flow [2025-03-04 02:17:55,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=980, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2025-03-04 02:17:55,380 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 69 predicate places. [2025-03-04 02:17:55,381 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 980 flow [2025-03-04 02:17:55,381 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:17:55,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:55,381 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:17:55,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:55,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:55,581 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:55,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1360628359, now seen corresponding path program 2 times [2025-03-04 02:17:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202622710] [2025-03-04 02:17:55,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:55,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:55,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:55,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:55,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202622710] [2025-03-04 02:17:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202622710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840570698] [2025-03-04 02:17:55,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:55,769 INFO L229 MonitoredProcess]: Starting monitored process 10 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:17:55,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:17:55,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:55,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:55,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:55,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:55,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:17:55,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:55,894 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:17:55,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 02:17:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:55,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:55,965 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:55,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840570698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:55,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:55,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-04 02:17:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60823299] [2025-03-04 02:17:55,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:55,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:17:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:55,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:17:55,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:17:56,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:56,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 980 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:17:56,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:56,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:56,341 INFO L124 PetriNetUnfolderBase]: 574/1061 cut-off events. [2025-03-04 02:17:56,341 INFO L125 PetriNetUnfolderBase]: For 5912/5943 co-relation queries the response was YES. [2025-03-04 02:17:56,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4992 conditions, 1061 events. 574/1061 cut-off events. For 5912/5943 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5500 event pairs, 174 based on Foata normal form. 10/1069 useless extension candidates. Maximal degree in co-relation 4941. Up to 442 conditions per place. [2025-03-04 02:17:56,370 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 75 selfloop transitions, 39 changer transitions 0/117 dead transitions. [2025-03-04 02:17:56,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 117 transitions, 1426 flow [2025-03-04 02:17:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:17:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:17:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-04 02:17:56,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-04 02:17:56,371 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 980 flow. Second operand 10 states and 123 transitions. [2025-03-04 02:17:56,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 117 transitions, 1426 flow [2025-03-04 02:17:56,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 117 transitions, 1386 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:17:56,383 INFO L231 Difference]: Finished difference. Result has 105 places, 81 transitions, 1112 flow [2025-03-04 02:17:56,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1112, PETRI_PLACES=105, PETRI_TRANSITIONS=81} [2025-03-04 02:17:56,383 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 79 predicate places. [2025-03-04 02:17:56,383 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 1112 flow [2025-03-04 02:17:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:17:56,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:56,383 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:17:56,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:56,584 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:56,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1630671351, now seen corresponding path program 3 times [2025-03-04 02:17:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034523201] [2025-03-04 02:17:56,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:56,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:56,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:56,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:17:56,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034523201] [2025-03-04 02:17:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034523201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:17:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289387689] [2025-03-04 02:17:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:17:56,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:56,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 1112 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:56,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:56,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:56,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:57,029 INFO L124 PetriNetUnfolderBase]: 569/1052 cut-off events. [2025-03-04 02:17:57,029 INFO L125 PetriNetUnfolderBase]: For 6787/6820 co-relation queries the response was YES. [2025-03-04 02:17:57,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5078 conditions, 1052 events. 569/1052 cut-off events. For 6787/6820 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5513 event pairs, 174 based on Foata normal form. 5/1056 useless extension candidates. Maximal degree in co-relation 5022. Up to 442 conditions per place. [2025-03-04 02:17:57,037 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 32 changer transitions 10/121 dead transitions. [2025-03-04 02:17:57,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 121 transitions, 1566 flow [2025-03-04 02:17:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-04 02:17:57,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-04 02:17:57,038 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 1112 flow. Second operand 9 states and 106 transitions. [2025-03-04 02:17:57,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 121 transitions, 1566 flow [2025-03-04 02:17:57,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 121 transitions, 1498 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:57,052 INFO L231 Difference]: Finished difference. Result has 109 places, 79 transitions, 1063 flow [2025-03-04 02:17:57,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1063, PETRI_PLACES=109, PETRI_TRANSITIONS=79} [2025-03-04 02:17:57,053 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 83 predicate places. [2025-03-04 02:17:57,053 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 79 transitions, 1063 flow [2025-03-04 02:17:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:57,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:57,053 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:17:57,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:17:57,053 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1169446033, now seen corresponding path program 1 times [2025-03-04 02:17:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013872346] [2025-03-04 02:17:57,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:57,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:17:57,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013872346] [2025-03-04 02:17:57,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013872346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720392720] [2025-03-04 02:17:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:57,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:57,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:57,219 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:57,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:17:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:17:57,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:57,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:57,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:17:57,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:57,327 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:17:57,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 02:17:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:57,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:57,400 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:17:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:17:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720392720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:57,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-04 02:17:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975547603] [2025-03-04 02:17:57,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:57,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:17:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:57,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:17:57,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:17:57,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:57,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 79 transitions, 1063 flow. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:17:57,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:57,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:57,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:57,724 INFO L124 PetriNetUnfolderBase]: 593/1100 cut-off events. [2025-03-04 02:17:57,725 INFO L125 PetriNetUnfolderBase]: For 6413/6441 co-relation queries the response was YES. [2025-03-04 02:17:57,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1100 events. 593/1100 cut-off events. For 6413/6441 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5804 event pairs, 96 based on Foata normal form. 12/1112 useless extension candidates. Maximal degree in co-relation 5213. Up to 408 conditions per place. [2025-03-04 02:17:57,730 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 89 selfloop transitions, 36 changer transitions 0/128 dead transitions. [2025-03-04 02:17:57,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 1617 flow [2025-03-04 02:17:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:17:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:17:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-03-04 02:17:57,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:17:57,731 INFO L175 Difference]: Start difference. First operand has 109 places, 79 transitions, 1063 flow. Second operand 10 states and 119 transitions. [2025-03-04 02:17:57,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 1617 flow [2025-03-04 02:17:57,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 128 transitions, 1540 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 02:17:57,743 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 1095 flow [2025-03-04 02:17:57,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1095, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2025-03-04 02:17:57,743 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 84 predicate places. [2025-03-04 02:17:57,743 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 81 transitions, 1095 flow [2025-03-04 02:17:57,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:17:57,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:57,743 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:17:57,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:57,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 02:17:57,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 79369371, now seen corresponding path program 4 times [2025-03-04 02:17:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718551382] [2025-03-04 02:17:57,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:57,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:57,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:57,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:57,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718551382] [2025-03-04 02:17:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718551382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:17:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296434314] [2025-03-04 02:17:58,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:58,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:58,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:58,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:58,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:17:58,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:58,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 81 transitions, 1095 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:17:58,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:58,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:58,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:58,233 INFO L124 PetriNetUnfolderBase]: 615/1126 cut-off events. [2025-03-04 02:17:58,233 INFO L125 PetriNetUnfolderBase]: For 7911/7944 co-relation queries the response was YES. [2025-03-04 02:17:58,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5625 conditions, 1126 events. 615/1126 cut-off events. For 7911/7944 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5840 event pairs, 262 based on Foata normal form. 10/1127 useless extension candidates. Maximal degree in co-relation 5568. Up to 519 conditions per place. [2025-03-04 02:17:58,238 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 71 selfloop transitions, 39 changer transitions 0/113 dead transitions. [2025-03-04 02:17:58,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 1523 flow [2025-03-04 02:17:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-04 02:17:58,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-04 02:17:58,239 INFO L175 Difference]: Start difference. First operand has 110 places, 81 transitions, 1095 flow. Second operand 7 states and 100 transitions. [2025-03-04 02:17:58,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 1523 flow [2025-03-04 02:17:58,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 1428 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 02:17:58,251 INFO L231 Difference]: Finished difference. Result has 112 places, 87 transitions, 1212 flow [2025-03-04 02:17:58,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1212, PETRI_PLACES=112, PETRI_TRANSITIONS=87} [2025-03-04 02:17:58,251 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 86 predicate places. [2025-03-04 02:17:58,251 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 1212 flow [2025-03-04 02:17:58,251 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:17:58,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:58,251 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:17:58,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 02:17:58,251 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 262668121, now seen corresponding path program 2 times [2025-03-04 02:17:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808696753] [2025-03-04 02:17:58,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:58,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:58,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:17:58,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:17:58,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808696753] [2025-03-04 02:17:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808696753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:17:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598060613] [2025-03-04 02:17:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:58,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:58,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:17:58,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:58,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 87 transitions, 1212 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:58,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:58,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:58,669 INFO L124 PetriNetUnfolderBase]: 700/1288 cut-off events. [2025-03-04 02:17:58,669 INFO L125 PetriNetUnfolderBase]: For 7510/7544 co-relation queries the response was YES. [2025-03-04 02:17:58,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 1288 events. 700/1288 cut-off events. For 7510/7544 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7026 event pairs, 234 based on Foata normal form. 12/1296 useless extension candidates. Maximal degree in co-relation 6285. Up to 528 conditions per place. [2025-03-04 02:17:58,675 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 89 selfloop transitions, 42 changer transitions 0/134 dead transitions. [2025-03-04 02:17:58,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 134 transitions, 1785 flow [2025-03-04 02:17:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:17:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:17:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-04 02:17:58,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:17:58,676 INFO L175 Difference]: Start difference. First operand has 112 places, 87 transitions, 1212 flow. Second operand 9 states and 117 transitions. [2025-03-04 02:17:58,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 134 transitions, 1785 flow [2025-03-04 02:17:58,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 134 transitions, 1704 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:58,690 INFO L231 Difference]: Finished difference. Result has 118 places, 91 transitions, 1291 flow [2025-03-04 02:17:58,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1291, PETRI_PLACES=118, PETRI_TRANSITIONS=91} [2025-03-04 02:17:58,691 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2025-03-04 02:17:58,691 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 91 transitions, 1291 flow [2025-03-04 02:17:58,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:58,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:58,691 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:17:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 02:17:58,691 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1092061903, now seen corresponding path program 5 times [2025-03-04 02:17:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:58,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-03-04 02:17:58,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:58,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:58,705 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:58,705 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-03-04 02:17:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437147865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299735851] [2025-03-04 02:17:58,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:58,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:58,887 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17:58,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:17:58,934 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:58,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:17:58,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:58,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:58,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:58,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:59,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:59,102 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:59,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299735851] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:17:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 19 [2025-03-04 02:17:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996848681] [2025-03-04 02:17:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:59,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:17:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:59,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:17:59,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:17:59,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:59,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 91 transitions, 1291 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:17:59,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:59,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:59,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:59,398 INFO L124 PetriNetUnfolderBase]: 720/1342 cut-off events. [2025-03-04 02:17:59,398 INFO L125 PetriNetUnfolderBase]: For 8621/8658 co-relation queries the response was YES. [2025-03-04 02:17:59,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1342 events. 720/1342 cut-off events. For 8621/8658 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7476 event pairs, 310 based on Foata normal form. 10/1341 useless extension candidates. Maximal degree in co-relation 6519. Up to 668 conditions per place. [2025-03-04 02:17:59,405 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 87 selfloop transitions, 38 changer transitions 0/128 dead transitions. [2025-03-04 02:17:59,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 1740 flow [2025-03-04 02:17:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:17:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:17:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-04 02:17:59,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2025-03-04 02:17:59,406 INFO L175 Difference]: Start difference. First operand has 118 places, 91 transitions, 1291 flow. Second operand 7 states and 109 transitions. [2025-03-04 02:17:59,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 1740 flow [2025-03-04 02:17:59,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 128 transitions, 1666 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 02:17:59,420 INFO L231 Difference]: Finished difference. Result has 124 places, 96 transitions, 1420 flow [2025-03-04 02:17:59,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1420, PETRI_PLACES=124, PETRI_TRANSITIONS=96} [2025-03-04 02:17:59,421 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 98 predicate places. [2025-03-04 02:17:59,421 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 96 transitions, 1420 flow [2025-03-04 02:17:59,421 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:17:59,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:59,421 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:17:59,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:17:59,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:17:59,621 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:59,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash 160477153, now seen corresponding path program 3 times [2025-03-04 02:17:59,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:59,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022922949] [2025-03-04 02:17:59,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:59,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:17:59,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:17:59,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:17:59,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:17:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022922949] [2025-03-04 02:17:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022922949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:17:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:17:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:17:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875650153] [2025-03-04 02:17:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:17:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:17:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:59,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:17:59,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:17:59,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:59,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 96 transitions, 1420 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:17:59,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:59,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:00,050 INFO L124 PetriNetUnfolderBase]: 708/1336 cut-off events. [2025-03-04 02:18:00,050 INFO L125 PetriNetUnfolderBase]: For 7700/7735 co-relation queries the response was YES. [2025-03-04 02:18:00,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 1336 events. 708/1336 cut-off events. For 7700/7735 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7570 event pairs, 269 based on Foata normal form. 12/1342 useless extension candidates. Maximal degree in co-relation 6459. Up to 630 conditions per place. [2025-03-04 02:18:00,057 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 82 selfloop transitions, 44 changer transitions 0/129 dead transitions. [2025-03-04 02:18:00,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 1850 flow [2025-03-04 02:18:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-04 02:18:00,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:18:00,058 INFO L175 Difference]: Start difference. First operand has 124 places, 96 transitions, 1420 flow. Second operand 9 states and 108 transitions. [2025-03-04 02:18:00,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 1850 flow [2025-03-04 02:18:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 1754 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:00,073 INFO L231 Difference]: Finished difference. Result has 131 places, 98 transitions, 1454 flow [2025-03-04 02:18:00,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1454, PETRI_PLACES=131, PETRI_TRANSITIONS=98} [2025-03-04 02:18:00,074 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 105 predicate places. [2025-03-04 02:18:00,074 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 98 transitions, 1454 flow [2025-03-04 02:18:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:00,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:00,074 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:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 02:18:00,074 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:00,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1436471035, now seen corresponding path program 6 times [2025-03-04 02:18:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436832319] [2025-03-04 02:18:00,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:00,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:00,081 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:00,082 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:00,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436832319] [2025-03-04 02:18:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436832319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:00,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897501750] [2025-03-04 02:18:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:00,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:00,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:00,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:00,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:00,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 98 transitions, 1454 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:00,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:00,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:00,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:00,464 INFO L124 PetriNetUnfolderBase]: 708/1340 cut-off events. [2025-03-04 02:18:00,464 INFO L125 PetriNetUnfolderBase]: For 7140/7175 co-relation queries the response was YES. [2025-03-04 02:18:00,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6556 conditions, 1340 events. 708/1340 cut-off events. For 7140/7175 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7627 event pairs, 277 based on Foata normal form. 5/1339 useless extension candidates. Maximal degree in co-relation 6491. Up to 649 conditions per place. [2025-03-04 02:18:00,471 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 77 selfloop transitions, 42 changer transitions 4/126 dead transitions. [2025-03-04 02:18:00,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 126 transitions, 1830 flow [2025-03-04 02:18:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2025-03-04 02:18:00,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-03-04 02:18:00,472 INFO L175 Difference]: Start difference. First operand has 131 places, 98 transitions, 1454 flow. Second operand 9 states and 104 transitions. [2025-03-04 02:18:00,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 126 transitions, 1830 flow [2025-03-04 02:18:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 126 transitions, 1738 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:00,487 INFO L231 Difference]: Finished difference. Result has 134 places, 97 transitions, 1437 flow [2025-03-04 02:18:00,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1437, PETRI_PLACES=134, PETRI_TRANSITIONS=97} [2025-03-04 02:18:00,490 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-03-04 02:18:00,490 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 97 transitions, 1437 flow [2025-03-04 02:18:00,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:00,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:00,490 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:00,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 02:18:00,491 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1765173287, now seen corresponding path program 4 times [2025-03-04 02:18:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664013742] [2025-03-04 02:18:00,491 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:00,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:00,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:00,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664013742] [2025-03-04 02:18:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664013742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352815189] [2025-03-04 02:18:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:00,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:00,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:00,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:00,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 97 transitions, 1437 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:18:00,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:00,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:00,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:00,778 INFO L124 PetriNetUnfolderBase]: 680/1275 cut-off events. [2025-03-04 02:18:00,778 INFO L125 PetriNetUnfolderBase]: For 6808/6845 co-relation queries the response was YES. [2025-03-04 02:18:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6330 conditions, 1275 events. 680/1275 cut-off events. For 6808/6845 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7092 event pairs, 257 based on Foata normal form. 4/1275 useless extension candidates. Maximal degree in co-relation 6264. Up to 602 conditions per place. [2025-03-04 02:18:00,783 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 78 selfloop transitions, 38 changer transitions 3/122 dead transitions. [2025-03-04 02:18:00,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 122 transitions, 1777 flow [2025-03-04 02:18:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-03-04 02:18:00,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:18:00,785 INFO L175 Difference]: Start difference. First operand has 134 places, 97 transitions, 1437 flow. Second operand 7 states and 91 transitions. [2025-03-04 02:18:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 122 transitions, 1777 flow [2025-03-04 02:18:00,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 122 transitions, 1722 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:00,800 INFO L231 Difference]: Finished difference. Result has 132 places, 95 transitions, 1412 flow [2025-03-04 02:18:00,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1412, PETRI_PLACES=132, PETRI_TRANSITIONS=95} [2025-03-04 02:18:00,802 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 106 predicate places. [2025-03-04 02:18:00,802 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 95 transitions, 1412 flow [2025-03-04 02:18:00,802 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:18:00,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:00,802 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:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 02:18:00,802 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:00,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871807, now seen corresponding path program 7 times [2025-03-04 02:18:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968852979] [2025-03-04 02:18:00,802 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:00,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:00,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:00,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968852979] [2025-03-04 02:18:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968852979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:00,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989973578] [2025-03-04 02:18:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:00,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:00,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:00,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:00,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 95 transitions, 1412 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:00,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:00,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:00,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:01,204 INFO L124 PetriNetUnfolderBase]: 648/1204 cut-off events. [2025-03-04 02:18:01,204 INFO L125 PetriNetUnfolderBase]: For 6929/6964 co-relation queries the response was YES. [2025-03-04 02:18:01,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 1204 events. 648/1204 cut-off events. For 6929/6964 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6539 event pairs, 239 based on Foata normal form. 5/1203 useless extension candidates. Maximal degree in co-relation 6056. Up to 595 conditions per place. [2025-03-04 02:18:01,209 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 74 selfloop transitions, 38 changer transitions 8/123 dead transitions. [2025-03-04 02:18:01,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 123 transitions, 1761 flow [2025-03-04 02:18:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-04 02:18:01,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-04 02:18:01,210 INFO L175 Difference]: Start difference. First operand has 132 places, 95 transitions, 1412 flow. Second operand 9 states and 103 transitions. [2025-03-04 02:18:01,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 123 transitions, 1761 flow [2025-03-04 02:18:01,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 1679 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:01,225 INFO L231 Difference]: Finished difference. Result has 133 places, 92 transitions, 1356 flow [2025-03-04 02:18:01,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=133, PETRI_TRANSITIONS=92} [2025-03-04 02:18:01,226 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 107 predicate places. [2025-03-04 02:18:01,226 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 92 transitions, 1356 flow [2025-03-04 02:18:01,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:01,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:01,226 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:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 02:18:01,227 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1427274783, now seen corresponding path program 5 times [2025-03-04 02:18:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-03-04 02:18:01,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:01,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:01,240 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:01,243 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:01,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-03-04 02:18:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479786578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990477056] [2025-03-04 02:18:01,382 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:01,384 INFO L229 MonitoredProcess]: Starting monitored process 13 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:01,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:18:01,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:01,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:01,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:01,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:01,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:01,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:01,610 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:01,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990477056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:01,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-03-04 02:18:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377012620] [2025-03-04 02:18:01,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:18:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:01,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:18:01,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:18:01,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:01,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 92 transitions, 1356 flow. Second operand has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 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:01,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:01,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:01,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:01,929 INFO L124 PetriNetUnfolderBase]: 726/1340 cut-off events. [2025-03-04 02:18:01,929 INFO L125 PetriNetUnfolderBase]: For 7975/8016 co-relation queries the response was YES. [2025-03-04 02:18:01,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 1340 events. 726/1340 cut-off events. For 7975/8016 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7460 event pairs, 247 based on Foata normal form. 12/1345 useless extension candidates. Maximal degree in co-relation 6733. Up to 609 conditions per place. [2025-03-04 02:18:01,935 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 82 selfloop transitions, 44 changer transitions 0/129 dead transitions. [2025-03-04 02:18:01,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 129 transitions, 1791 flow [2025-03-04 02:18:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:18:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:18:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-03-04 02:18:01,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-04 02:18:01,936 INFO L175 Difference]: Start difference. First operand has 133 places, 92 transitions, 1356 flow. Second operand 11 states and 130 transitions. [2025-03-04 02:18:01,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 129 transitions, 1791 flow [2025-03-04 02:18:01,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 1703 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:01,951 INFO L231 Difference]: Finished difference. Result has 134 places, 95 transitions, 1415 flow [2025-03-04 02:18:01,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1415, PETRI_PLACES=134, PETRI_TRANSITIONS=95} [2025-03-04 02:18:01,952 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-03-04 02:18:01,952 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 95 transitions, 1415 flow [2025-03-04 02:18:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 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:01,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:01,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:01,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:02,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:02,153 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 970281313, now seen corresponding path program 8 times [2025-03-04 02:18:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485108128] [2025-03-04 02:18:02,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:02,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:02,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:02,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:02,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485108128] [2025-03-04 02:18:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485108128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:02,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849571273] [2025-03-04 02:18:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:02,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:02,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:02,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:02,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:02,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 95 transitions, 1415 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:02,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:02,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:02,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:02,513 INFO L124 PetriNetUnfolderBase]: 726/1343 cut-off events. [2025-03-04 02:18:02,514 INFO L125 PetriNetUnfolderBase]: For 9019/9055 co-relation queries the response was YES. [2025-03-04 02:18:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6881 conditions, 1343 events. 726/1343 cut-off events. For 9019/9055 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7452 event pairs, 323 based on Foata normal form. 5/1334 useless extension candidates. Maximal degree in co-relation 6814. Up to 744 conditions per place. [2025-03-04 02:18:02,519 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 71 selfloop transitions, 40 changer transitions 4/118 dead transitions. [2025-03-04 02:18:02,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 118 transitions, 1734 flow [2025-03-04 02:18:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-03-04 02:18:02,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2025-03-04 02:18:02,519 INFO L175 Difference]: Start difference. First operand has 134 places, 95 transitions, 1415 flow. Second operand 9 states and 107 transitions. [2025-03-04 02:18:02,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 118 transitions, 1734 flow [2025-03-04 02:18:02,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 118 transitions, 1659 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:02,533 INFO L231 Difference]: Finished difference. Result has 137 places, 96 transitions, 1447 flow [2025-03-04 02:18:02,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1447, PETRI_PLACES=137, PETRI_TRANSITIONS=96} [2025-03-04 02:18:02,534 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-04 02:18:02,534 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 96 transitions, 1447 flow [2025-03-04 02:18:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:02,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:02,534 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:02,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 02:18:02,534 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:02,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2007885113, now seen corresponding path program 6 times [2025-03-04 02:18:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769550457] [2025-03-04 02:18:02,534 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:02,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:02,543 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:02,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:18:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:02,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769550457] [2025-03-04 02:18:02,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769550457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:02,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333099035] [2025-03-04 02:18:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:02,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:02,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:02,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:02,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:02,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 96 transitions, 1447 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:02,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:02,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:02,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:02,902 INFO L124 PetriNetUnfolderBase]: 724/1339 cut-off events. [2025-03-04 02:18:02,902 INFO L125 PetriNetUnfolderBase]: For 8517/8555 co-relation queries the response was YES. [2025-03-04 02:18:02,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6883 conditions, 1339 events. 724/1339 cut-off events. For 8517/8555 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7421 event pairs, 330 based on Foata normal form. 4/1330 useless extension candidates. Maximal degree in co-relation 6816. Up to 744 conditions per place. [2025-03-04 02:18:02,908 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 71 selfloop transitions, 40 changer transitions 4/118 dead transitions. [2025-03-04 02:18:02,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 118 transitions, 1752 flow [2025-03-04 02:18:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2025-03-04 02:18:02,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-03-04 02:18:02,910 INFO L175 Difference]: Start difference. First operand has 137 places, 96 transitions, 1447 flow. Second operand 9 states and 104 transitions. [2025-03-04 02:18:02,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 118 transitions, 1752 flow [2025-03-04 02:18:02,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 118 transitions, 1666 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:02,926 INFO L231 Difference]: Finished difference. Result has 139 places, 95 transitions, 1426 flow [2025-03-04 02:18:02,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1426, PETRI_PLACES=139, PETRI_TRANSITIONS=95} [2025-03-04 02:18:02,927 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 113 predicate places. [2025-03-04 02:18:02,927 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 95 transitions, 1426 flow [2025-03-04 02:18:02,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:02,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:02,927 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:02,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 02:18:02,927 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash -42411219, now seen corresponding path program 9 times [2025-03-04 02:18:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607717686] [2025-03-04 02:18:02,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:02,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:02,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:02,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:02,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607717686] [2025-03-04 02:18:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607717686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101499468] [2025-03-04 02:18:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:03,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:03,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:03,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 95 transitions, 1426 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:03,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:03,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,307 INFO L124 PetriNetUnfolderBase]: 688/1262 cut-off events. [2025-03-04 02:18:03,308 INFO L125 PetriNetUnfolderBase]: For 8294/8331 co-relation queries the response was YES. [2025-03-04 02:18:03,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6598 conditions, 1262 events. 688/1262 cut-off events. For 8294/8331 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6850 event pairs, 318 based on Foata normal form. 5/1256 useless extension candidates. Maximal degree in co-relation 6530. Up to 744 conditions per place. [2025-03-04 02:18:03,314 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 69 selfloop transitions, 40 changer transitions 4/116 dead transitions. [2025-03-04 02:18:03,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 116 transitions, 1690 flow [2025-03-04 02:18:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-04 02:18:03,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-04 02:18:03,315 INFO L175 Difference]: Start difference. First operand has 139 places, 95 transitions, 1426 flow. Second operand 9 states and 106 transitions. [2025-03-04 02:18:03,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 116 transitions, 1690 flow [2025-03-04 02:18:03,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 116 transitions, 1581 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:03,330 INFO L231 Difference]: Finished difference. Result has 135 places, 93 transitions, 1360 flow [2025-03-04 02:18:03,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1360, PETRI_PLACES=135, PETRI_TRANSITIONS=93} [2025-03-04 02:18:03,331 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 109 predicate places. [2025-03-04 02:18:03,331 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 93 transitions, 1360 flow [2025-03-04 02:18:03,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:03,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,331 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:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 02:18:03,331 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1529465751, now seen corresponding path program 7 times [2025-03-04 02:18:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953677133] [2025-03-04 02:18:03,332 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:03,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:03,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:03,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953677133] [2025-03-04 02:18:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953677133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229742316] [2025-03-04 02:18:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:03,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:03,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:03,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 93 transitions, 1360 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:03,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:03,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,730 INFO L124 PetriNetUnfolderBase]: 703/1286 cut-off events. [2025-03-04 02:18:03,731 INFO L125 PetriNetUnfolderBase]: For 8646/8683 co-relation queries the response was YES. [2025-03-04 02:18:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6731 conditions, 1286 events. 703/1286 cut-off events. For 8646/8683 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6968 event pairs, 321 based on Foata normal form. 12/1287 useless extension candidates. Maximal degree in co-relation 6666. Up to 754 conditions per place. [2025-03-04 02:18:03,735 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 75 selfloop transitions, 39 changer transitions 0/117 dead transitions. [2025-03-04 02:18:03,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 117 transitions, 1678 flow [2025-03-04 02:18:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-04 02:18:03,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:18:03,737 INFO L175 Difference]: Start difference. First operand has 135 places, 93 transitions, 1360 flow. Second operand 9 states and 108 transitions. [2025-03-04 02:18:03,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 117 transitions, 1678 flow [2025-03-04 02:18:03,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 117 transitions, 1598 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:03,750 INFO L231 Difference]: Finished difference. Result has 136 places, 94 transitions, 1381 flow [2025-03-04 02:18:03,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=136, PETRI_TRANSITIONS=94} [2025-03-04 02:18:03,751 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2025-03-04 02:18:03,751 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 94 transitions, 1381 flow [2025-03-04 02:18:03,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:03,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,751 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:03,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 02:18:03,751 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1436804125, now seen corresponding path program 8 times [2025-03-04 02:18:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702716302] [2025-03-04 02:18:03,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:03,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:03,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:03,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702716302] [2025-03-04 02:18:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702716302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:03,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031641632] [2025-03-04 02:18:03,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:03,901 INFO L229 MonitoredProcess]: Starting monitored process 14 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:03,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:18:03,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:03,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:03,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:03,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:18:03,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:04,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:04,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 02:18:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:04,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:04,077 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:04,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:04,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031641632] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:04,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:04,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 17 [2025-03-04 02:18:04,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71916351] [2025-03-04 02:18:04,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:04,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:18:04,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:04,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 94 transitions, 1381 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:18:04,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:04,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,289 INFO L124 PetriNetUnfolderBase]: 717/1338 cut-off events. [2025-03-04 02:18:04,289 INFO L125 PetriNetUnfolderBase]: For 8566/8604 co-relation queries the response was YES. [2025-03-04 02:18:04,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6825 conditions, 1338 events. 717/1338 cut-off events. For 8566/8604 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7504 event pairs, 308 based on Foata normal form. 12/1340 useless extension candidates. Maximal degree in co-relation 6759. Up to 749 conditions per place. [2025-03-04 02:18:04,294 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 83 selfloop transitions, 38 changer transitions 0/124 dead transitions. [2025-03-04 02:18:04,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 124 transitions, 1734 flow [2025-03-04 02:18:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-03-04 02:18:04,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-03-04 02:18:04,294 INFO L175 Difference]: Start difference. First operand has 136 places, 94 transitions, 1381 flow. Second operand 7 states and 103 transitions. [2025-03-04 02:18:04,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 124 transitions, 1734 flow [2025-03-04 02:18:04,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 124 transitions, 1648 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:04,307 INFO L231 Difference]: Finished difference. Result has 136 places, 95 transitions, 1400 flow [2025-03-04 02:18:04,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1400, PETRI_PLACES=136, PETRI_TRANSITIONS=95} [2025-03-04 02:18:04,307 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2025-03-04 02:18:04,307 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 95 transitions, 1400 flow [2025-03-04 02:18:04,307 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:18:04,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,307 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:04,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:18:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 02:18:04,508 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 839851105, now seen corresponding path program 9 times [2025-03-04 02:18:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549580620] [2025-03-04 02:18:04,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:04,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:04,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549580620] [2025-03-04 02:18:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549580620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:04,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:04,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415359008] [2025-03-04 02:18:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:04,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:04,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:04,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 95 transitions, 1400 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:04,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:04,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,822 INFO L124 PetriNetUnfolderBase]: 691/1275 cut-off events. [2025-03-04 02:18:04,823 INFO L125 PetriNetUnfolderBase]: For 7480/7520 co-relation queries the response was YES. [2025-03-04 02:18:04,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6603 conditions, 1275 events. 691/1275 cut-off events. For 7480/7520 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7042 event pairs, 288 based on Foata normal form. 4/1270 useless extension candidates. Maximal degree in co-relation 6537. Up to 761 conditions per place. [2025-03-04 02:18:04,828 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 70 selfloop transitions, 37 changer transitions 3/113 dead transitions. [2025-03-04 02:18:04,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 113 transitions, 1648 flow [2025-03-04 02:18:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-04 02:18:04,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-04 02:18:04,828 INFO L175 Difference]: Start difference. First operand has 136 places, 95 transitions, 1400 flow. Second operand 9 states and 103 transitions. [2025-03-04 02:18:04,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 113 transitions, 1648 flow [2025-03-04 02:18:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 113 transitions, 1579 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:04,843 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 1361 flow [2025-03-04 02:18:04,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1361, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-03-04 02:18:04,843 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 114 predicate places. [2025-03-04 02:18:04,843 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 1361 flow [2025-03-04 02:18:04,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:04,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,843 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:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 02:18:04,843 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 432425735, now seen corresponding path program 10 times [2025-03-04 02:18:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435145265] [2025-03-04 02:18:04,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:04,851 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:04,851 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:04,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435145265] [2025-03-04 02:18:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435145265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390951577] [2025-03-04 02:18:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:04,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:04,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:04,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 1361 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:18:04,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:05,099 INFO L124 PetriNetUnfolderBase]: 659/1209 cut-off events. [2025-03-04 02:18:05,099 INFO L125 PetriNetUnfolderBase]: For 7842/7876 co-relation queries the response was YES. [2025-03-04 02:18:05,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 1209 events. 659/1209 cut-off events. For 7842/7876 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6506 event pairs, 301 based on Foata normal form. 5/1203 useless extension candidates. Maximal degree in co-relation 6289. Up to 768 conditions per place. [2025-03-04 02:18:05,105 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 69 selfloop transitions, 32 changer transitions 8/112 dead transitions. [2025-03-04 02:18:05,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 112 transitions, 1613 flow [2025-03-04 02:18:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2025-03-04 02:18:05,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-03-04 02:18:05,106 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 1361 flow. Second operand 7 states and 92 transitions. [2025-03-04 02:18:05,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 112 transitions, 1613 flow [2025-03-04 02:18:05,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 112 transitions, 1533 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:05,119 INFO L231 Difference]: Finished difference. Result has 136 places, 90 transitions, 1296 flow [2025-03-04 02:18:05,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1296, PETRI_PLACES=136, PETRI_TRANSITIONS=90} [2025-03-04 02:18:05,119 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2025-03-04 02:18:05,119 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 90 transitions, 1296 flow [2025-03-04 02:18:05,119 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:18:05,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:05,119 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:05,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 02:18:05,120 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -488846315, now seen corresponding path program 10 times [2025-03-04 02:18:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-03-04 02:18:05,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:05,124 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:05,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:05,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-03-04 02:18:05,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663730455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:05,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:05,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964571667] [2025-03-04 02:18:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:05,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:05,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:05,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:05,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:05,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 90 transitions, 1296 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:18:05,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:05,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:05,324 INFO L124 PetriNetUnfolderBase]: 626/1134 cut-off events. [2025-03-04 02:18:05,324 INFO L125 PetriNetUnfolderBase]: For 7592/7627 co-relation queries the response was YES. [2025-03-04 02:18:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6068 conditions, 1134 events. 626/1134 cut-off events. For 7592/7627 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5914 event pairs, 281 based on Foata normal form. 4/1130 useless extension candidates. Maximal degree in co-relation 6002. Up to 714 conditions per place. [2025-03-04 02:18:05,329 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 66 selfloop transitions, 33 changer transitions 3/105 dead transitions. [2025-03-04 02:18:05,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 105 transitions, 1519 flow [2025-03-04 02:18:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-04 02:18:05,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2025-03-04 02:18:05,330 INFO L175 Difference]: Start difference. First operand has 136 places, 90 transitions, 1296 flow. Second operand 7 states and 87 transitions. [2025-03-04 02:18:05,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 105 transitions, 1519 flow [2025-03-04 02:18:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 105 transitions, 1440 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:05,341 INFO L231 Difference]: Finished difference. Result has 131 places, 88 transitions, 1245 flow [2025-03-04 02:18:05,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1245, PETRI_PLACES=131, PETRI_TRANSITIONS=88} [2025-03-04 02:18:05,341 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 105 predicate places. [2025-03-04 02:18:05,341 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 88 transitions, 1245 flow [2025-03-04 02:18:05,341 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:18:05,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:05,341 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:05,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 02:18:05,342 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1475291291, now seen corresponding path program 11 times [2025-03-04 02:18:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361129710] [2025-03-04 02:18:05,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:05,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:05,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:05,350 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:05,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:05,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361129710] [2025-03-04 02:18:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361129710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:05,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758451823] [2025-03-04 02:18:05,479 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:05,481 INFO L229 MonitoredProcess]: Starting monitored process 15 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:05,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:18:05,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:05,543 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:05,543 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:05,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 02:18:05,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:05,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:05,638 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:05,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758451823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:05,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-04 02:18:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532652800] [2025-03-04 02:18:05,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:18:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:05,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:18:05,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:18:05,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:05,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 88 transitions, 1245 flow. Second operand has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 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:05,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:05,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:05,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:05,871 INFO L124 PetriNetUnfolderBase]: 704/1283 cut-off events. [2025-03-04 02:18:05,871 INFO L125 PetriNetUnfolderBase]: For 8819/8855 co-relation queries the response was YES. [2025-03-04 02:18:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 1283 events. 704/1283 cut-off events. For 8819/8855 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6962 event pairs, 250 based on Foata normal form. 10/1289 useless extension candidates. Maximal degree in co-relation 6727. Up to 620 conditions per place. [2025-03-04 02:18:05,876 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 80 selfloop transitions, 41 changer transitions 0/124 dead transitions. [2025-03-04 02:18:05,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 1699 flow [2025-03-04 02:18:05,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2025-03-04 02:18:05,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-03-04 02:18:05,877 INFO L175 Difference]: Start difference. First operand has 131 places, 88 transitions, 1245 flow. Second operand 9 states and 119 transitions. [2025-03-04 02:18:05,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 124 transitions, 1699 flow [2025-03-04 02:18:05,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 124 transitions, 1629 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:18:05,890 INFO L231 Difference]: Finished difference. Result has 134 places, 91 transitions, 1326 flow [2025-03-04 02:18:05,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1326, PETRI_PLACES=134, PETRI_TRANSITIONS=91} [2025-03-04 02:18:05,891 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-03-04 02:18:05,891 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 91 transitions, 1326 flow [2025-03-04 02:18:05,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 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:05,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:05,891 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:05,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:06,091 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1671358821, now seen corresponding path program 12 times [2025-03-04 02:18:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053908105] [2025-03-04 02:18:06,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:06,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:06,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:06,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:18:06,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053908105] [2025-03-04 02:18:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053908105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739447318] [2025-03-04 02:18:06,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:06,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:06,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:06,246 INFO L229 MonitoredProcess]: Starting monitored process 16 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:06,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:18:06,295 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:06,313 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:06,314 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:18:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:06,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:18:06,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:06,371 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:18:06,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 02:18:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:06,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:06,433 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:18:06,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:18:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739447318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:06,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-04 02:18:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149404181] [2025-03-04 02:18:06,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:06,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:18:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:06,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:18:06,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:18:06,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:06,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 91 transitions, 1326 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:06,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:06,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:06,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:06,714 INFO L124 PetriNetUnfolderBase]: 734/1345 cut-off events. [2025-03-04 02:18:06,714 INFO L125 PetriNetUnfolderBase]: For 9677/9707 co-relation queries the response was YES. [2025-03-04 02:18:06,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7267 conditions, 1345 events. 734/1345 cut-off events. For 9677/9707 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7424 event pairs, 71 based on Foata normal form. 10/1355 useless extension candidates. Maximal degree in co-relation 7199. Up to 668 conditions per place. [2025-03-04 02:18:06,720 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 87 selfloop transitions, 38 changer transitions 1/129 dead transitions. [2025-03-04 02:18:06,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 129 transitions, 1836 flow [2025-03-04 02:18:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:18:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:18:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-04 02:18:06,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-03-04 02:18:06,720 INFO L175 Difference]: Start difference. First operand has 134 places, 91 transitions, 1326 flow. Second operand 10 states and 113 transitions. [2025-03-04 02:18:06,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 129 transitions, 1836 flow [2025-03-04 02:18:06,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 129 transitions, 1773 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 02:18:06,736 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 1387 flow [2025-03-04 02:18:06,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1387, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-03-04 02:18:06,737 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 114 predicate places. [2025-03-04 02:18:06,737 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 1387 flow [2025-03-04 02:18:06,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:06,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:06,737 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:06,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:18:06,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:06,938 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -503163111, now seen corresponding path program 11 times [2025-03-04 02:18:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671717799] [2025-03-04 02:18:06,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:06,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:06,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:06,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:06,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671717799] [2025-03-04 02:18:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671717799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329700327] [2025-03-04 02:18:07,069 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:07,071 INFO L229 MonitoredProcess]: Starting monitored process 17 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:07,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:18:07,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:07,134 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:07,134 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:07,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:07,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:07,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:07,272 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:07,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329700327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:07,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-03-04 02:18:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701716686] [2025-03-04 02:18:07,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:18:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:07,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:18:07,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:18:07,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:07,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 1387 flow. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 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:07,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:07,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:07,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:07,602 INFO L124 PetriNetUnfolderBase]: 751/1362 cut-off events. [2025-03-04 02:18:07,603 INFO L125 PetriNetUnfolderBase]: For 11107/11149 co-relation queries the response was YES. [2025-03-04 02:18:07,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7655 conditions, 1362 events. 751/1362 cut-off events. For 11107/11149 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7490 event pairs, 312 based on Foata normal form. 12/1370 useless extension candidates. Maximal degree in co-relation 7584. Up to 805 conditions per place. [2025-03-04 02:18:07,609 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 82 selfloop transitions, 43 changer transitions 0/128 dead transitions. [2025-03-04 02:18:07,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 128 transitions, 1871 flow [2025-03-04 02:18:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:18:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:18:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2025-03-04 02:18:07,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40584415584415584 [2025-03-04 02:18:07,610 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 1387 flow. Second operand 11 states and 125 transitions. [2025-03-04 02:18:07,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 128 transitions, 1871 flow [2025-03-04 02:18:07,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 128 transitions, 1758 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:07,628 INFO L231 Difference]: Finished difference. Result has 145 places, 96 transitions, 1443 flow [2025-03-04 02:18:07,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1443, PETRI_PLACES=145, PETRI_TRANSITIONS=96} [2025-03-04 02:18:07,628 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 119 predicate places. [2025-03-04 02:18:07,628 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 96 transitions, 1443 flow [2025-03-04 02:18:07,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 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:07,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:07,628 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:07,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:07,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:07,829 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1349084739, now seen corresponding path program 13 times [2025-03-04 02:18:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-03-04 02:18:07,829 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:07,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-03-04 02:18:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056533326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233007531] [2025-03-04 02:18:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:07,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:07,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:07,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:07,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 96 transitions, 1443 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:07,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:07,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:07,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,231 INFO L124 PetriNetUnfolderBase]: 766/1389 cut-off events. [2025-03-04 02:18:08,231 INFO L125 PetriNetUnfolderBase]: For 10646/10690 co-relation queries the response was YES. [2025-03-04 02:18:08,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7787 conditions, 1389 events. 766/1389 cut-off events. For 10646/10690 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7646 event pairs, 257 based on Foata normal form. 10/1397 useless extension candidates. Maximal degree in co-relation 7714. Up to 702 conditions per place. [2025-03-04 02:18:08,238 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 91 selfloop transitions, 42 changer transitions 0/136 dead transitions. [2025-03-04 02:18:08,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 136 transitions, 1992 flow [2025-03-04 02:18:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-03-04 02:18:08,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-04 02:18:08,238 INFO L175 Difference]: Start difference. First operand has 145 places, 96 transitions, 1443 flow. Second operand 9 states and 114 transitions. [2025-03-04 02:18:08,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 136 transitions, 1992 flow [2025-03-04 02:18:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 136 transitions, 1878 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:08,258 INFO L231 Difference]: Finished difference. Result has 147 places, 99 transitions, 1498 flow [2025-03-04 02:18:08,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1498, PETRI_PLACES=147, PETRI_TRANSITIONS=99} [2025-03-04 02:18:08,258 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 121 predicate places. [2025-03-04 02:18:08,258 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 99 transitions, 1498 flow [2025-03-04 02:18:08,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:08,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,258 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:08,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 02:18:08,258 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1284943717, now seen corresponding path program 14 times [2025-03-04 02:18:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351817974] [2025-03-04 02:18:08,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:08,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:08,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:08,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351817974] [2025-03-04 02:18:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351817974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586489748] [2025-03-04 02:18:08,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:08,406 INFO L229 MonitoredProcess]: Starting monitored process 18 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:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:18:08,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:08,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:08,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:08,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:18:08,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:08,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:08,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 02:18:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:08,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:08,572 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:08,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586489748] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 17 [2025-03-04 02:18:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869443029] [2025-03-04 02:18:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:08,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:18:08,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:08,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 99 transitions, 1498 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:18:08,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:08,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,795 INFO L124 PetriNetUnfolderBase]: 818/1496 cut-off events. [2025-03-04 02:18:08,796 INFO L125 PetriNetUnfolderBase]: For 11754/11796 co-relation queries the response was YES. [2025-03-04 02:18:08,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8280 conditions, 1496 events. 818/1496 cut-off events. For 11754/11796 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8417 event pairs, 322 based on Foata normal form. 10/1502 useless extension candidates. Maximal degree in co-relation 8207. Up to 847 conditions per place. [2025-03-04 02:18:08,801 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 90 selfloop transitions, 42 changer transitions 0/135 dead transitions. [2025-03-04 02:18:08,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 135 transitions, 2016 flow [2025-03-04 02:18:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-03-04 02:18:08,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-03-04 02:18:08,801 INFO L175 Difference]: Start difference. First operand has 147 places, 99 transitions, 1498 flow. Second operand 7 states and 103 transitions. [2025-03-04 02:18:08,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 135 transitions, 2016 flow [2025-03-04 02:18:08,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 135 transitions, 1930 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 02:18:08,821 INFO L231 Difference]: Finished difference. Result has 151 places, 105 transitions, 1643 flow [2025-03-04 02:18:08,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1643, PETRI_PLACES=151, PETRI_TRANSITIONS=105} [2025-03-04 02:18:08,822 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 125 predicate places. [2025-03-04 02:18:08,822 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 105 transitions, 1643 flow [2025-03-04 02:18:08,822 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:18:08,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,822 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:08,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:18:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:09,022 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 225734487, now seen corresponding path program 15 times [2025-03-04 02:18:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953981298] [2025-03-04 02:18:09,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:09,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:09,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:09,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953981298] [2025-03-04 02:18:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953981298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656742309] [2025-03-04 02:18:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:09,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:09,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:09,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 105 transitions, 1643 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:09,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,390 INFO L124 PetriNetUnfolderBase]: 808/1478 cut-off events. [2025-03-04 02:18:09,391 INFO L125 PetriNetUnfolderBase]: For 10988/11032 co-relation queries the response was YES. [2025-03-04 02:18:09,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 1478 events. 808/1478 cut-off events. For 10988/11032 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8348 event pairs, 304 based on Foata normal form. 10/1478 useless extension candidates. Maximal degree in co-relation 8130. Up to 889 conditions per place. [2025-03-04 02:18:09,397 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 84 selfloop transitions, 47 changer transitions 0/134 dead transitions. [2025-03-04 02:18:09,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 134 transitions, 2084 flow [2025-03-04 02:18:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-04 02:18:09,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 02:18:09,398 INFO L175 Difference]: Start difference. First operand has 151 places, 105 transitions, 1643 flow. Second operand 9 states and 105 transitions. [2025-03-04 02:18:09,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 134 transitions, 2084 flow [2025-03-04 02:18:09,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 134 transitions, 2012 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:09,417 INFO L231 Difference]: Finished difference. Result has 159 places, 108 transitions, 1740 flow [2025-03-04 02:18:09,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1740, PETRI_PLACES=159, PETRI_TRANSITIONS=108} [2025-03-04 02:18:09,417 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 133 predicate places. [2025-03-04 02:18:09,417 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 108 transitions, 1740 flow [2025-03-04 02:18:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:09,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,417 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:09,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 02:18:09,417 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1580391413, now seen corresponding path program 16 times [2025-03-04 02:18:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666596263] [2025-03-04 02:18:09,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:09,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:09,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:09,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666596263] [2025-03-04 02:18:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666596263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094409568] [2025-03-04 02:18:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:09,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:09,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:09,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 108 transitions, 1740 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:18:09,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:09,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,712 INFO L124 PetriNetUnfolderBase]: 798/1477 cut-off events. [2025-03-04 02:18:09,712 INFO L125 PetriNetUnfolderBase]: For 10474/10513 co-relation queries the response was YES. [2025-03-04 02:18:09,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8123 conditions, 1477 events. 798/1477 cut-off events. For 10474/10513 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8394 event pairs, 332 based on Foata normal form. 10/1481 useless extension candidates. Maximal degree in co-relation 8044. Up to 886 conditions per place. [2025-03-04 02:18:09,719 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 85 selfloop transitions, 45 changer transitions 1/134 dead transitions. [2025-03-04 02:18:09,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 134 transitions, 2159 flow [2025-03-04 02:18:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-04 02:18:09,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-04 02:18:09,720 INFO L175 Difference]: Start difference. First operand has 159 places, 108 transitions, 1740 flow. Second operand 7 states and 100 transitions. [2025-03-04 02:18:09,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 134 transitions, 2159 flow [2025-03-04 02:18:09,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 134 transitions, 2045 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:09,741 INFO L231 Difference]: Finished difference. Result has 161 places, 110 transitions, 1767 flow [2025-03-04 02:18:09,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1767, PETRI_PLACES=161, PETRI_TRANSITIONS=110} [2025-03-04 02:18:09,742 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 135 predicate places. [2025-03-04 02:18:09,742 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 110 transitions, 1767 flow [2025-03-04 02:18:09,742 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:18:09,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,742 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:09,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 02:18:09,742 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:09,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -239139503, now seen corresponding path program 12 times [2025-03-04 02:18:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62763948] [2025-03-04 02:18:09,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:09,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:09,752 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:18:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62763948] [2025-03-04 02:18:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62763948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314481005] [2025-03-04 02:18:09,882 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:09,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:09,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:09,884 INFO L229 MonitoredProcess]: Starting monitored process 19 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:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:18:09,932 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:09,946 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:09,946 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:18:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:18:09,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:09,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 02:18:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:10,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:10,059 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:18:10,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:18:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314481005] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:10,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 18 [2025-03-04 02:18:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947302688] [2025-03-04 02:18:10,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:10,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:10,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:10,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:18:10,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:10,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 110 transitions, 1767 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:18:10,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:10,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:10,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:10,349 INFO L124 PetriNetUnfolderBase]: 831/1549 cut-off events. [2025-03-04 02:18:10,349 INFO L125 PetriNetUnfolderBase]: For 9523/9562 co-relation queries the response was YES. [2025-03-04 02:18:10,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8343 conditions, 1549 events. 831/1549 cut-off events. For 9523/9562 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8955 event pairs, 299 based on Foata normal form. 12/1555 useless extension candidates. Maximal degree in co-relation 8263. Up to 900 conditions per place. [2025-03-04 02:18:10,355 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 95 selfloop transitions, 46 changer transitions 0/144 dead transitions. [2025-03-04 02:18:10,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 144 transitions, 2233 flow [2025-03-04 02:18:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2025-03-04 02:18:10,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2025-03-04 02:18:10,356 INFO L175 Difference]: Start difference. First operand has 161 places, 110 transitions, 1767 flow. Second operand 7 states and 101 transitions. [2025-03-04 02:18:10,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 144 transitions, 2233 flow [2025-03-04 02:18:10,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 144 transitions, 2067 flow, removed 15 selfloop flow, removed 14 redundant places. [2025-03-04 02:18:10,375 INFO L231 Difference]: Finished difference. Result has 155 places, 113 transitions, 1770 flow [2025-03-04 02:18:10,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1770, PETRI_PLACES=155, PETRI_TRANSITIONS=113} [2025-03-04 02:18:10,375 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 129 predicate places. [2025-03-04 02:18:10,375 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 113 transitions, 1770 flow [2025-03-04 02:18:10,375 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:18:10,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:10,375 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:10,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:18:10,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:10,576 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:10,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1646832981, now seen corresponding path program 13 times [2025-03-04 02:18:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141406993] [2025-03-04 02:18:10,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:10,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:10,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:10,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141406993] [2025-03-04 02:18:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141406993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:10,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179797637] [2025-03-04 02:18:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:10,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:10,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:10,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 113 transitions, 1770 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:10,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:10,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:10,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:10,931 INFO L124 PetriNetUnfolderBase]: 827/1536 cut-off events. [2025-03-04 02:18:10,931 INFO L125 PetriNetUnfolderBase]: For 8551/8593 co-relation queries the response was YES. [2025-03-04 02:18:10,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8154 conditions, 1536 events. 827/1536 cut-off events. For 8551/8593 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8918 event pairs, 307 based on Foata normal form. 4/1528 useless extension candidates. Maximal degree in co-relation 8082. Up to 893 conditions per place. [2025-03-04 02:18:10,938 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 81 selfloop transitions, 47 changer transitions 3/134 dead transitions. [2025-03-04 02:18:10,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 134 transitions, 2097 flow [2025-03-04 02:18:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-03-04 02:18:10,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4007936507936508 [2025-03-04 02:18:10,939 INFO L175 Difference]: Start difference. First operand has 155 places, 113 transitions, 1770 flow. Second operand 9 states and 101 transitions. [2025-03-04 02:18:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 134 transitions, 2097 flow [2025-03-04 02:18:10,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 134 transitions, 2044 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:10,956 INFO L231 Difference]: Finished difference. Result has 161 places, 111 transitions, 1768 flow [2025-03-04 02:18:10,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1768, PETRI_PLACES=161, PETRI_TRANSITIONS=111} [2025-03-04 02:18:10,957 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 135 predicate places. [2025-03-04 02:18:10,957 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 111 transitions, 1768 flow [2025-03-04 02:18:10,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:10,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:10,957 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:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 02:18:10,957 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:10,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1072002133, now seen corresponding path program 14 times [2025-03-04 02:18:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-04 02:18:10,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:10,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:10,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:10,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:10,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048245458] [2025-03-04 02:18:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048245458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:11,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:11,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191824432] [2025-03-04 02:18:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:11,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:11,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:11,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 111 transitions, 1768 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:11,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:11,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:11,319 INFO L124 PetriNetUnfolderBase]: 821/1526 cut-off events. [2025-03-04 02:18:11,319 INFO L125 PetriNetUnfolderBase]: For 8768/8810 co-relation queries the response was YES. [2025-03-04 02:18:11,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8103 conditions, 1526 events. 821/1526 cut-off events. For 8768/8810 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8886 event pairs, 293 based on Foata normal form. 4/1518 useless extension candidates. Maximal degree in co-relation 8030. Up to 893 conditions per place. [2025-03-04 02:18:11,326 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 84 selfloop transitions, 43 changer transitions 6/136 dead transitions. [2025-03-04 02:18:11,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 136 transitions, 2118 flow [2025-03-04 02:18:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-04 02:18:11,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-04 02:18:11,326 INFO L175 Difference]: Start difference. First operand has 161 places, 111 transitions, 1768 flow. Second operand 9 states and 100 transitions. [2025-03-04 02:18:11,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 136 transitions, 2118 flow [2025-03-04 02:18:11,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 136 transitions, 2024 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:11,344 INFO L231 Difference]: Finished difference. Result has 161 places, 108 transitions, 1687 flow [2025-03-04 02:18:11,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1687, PETRI_PLACES=161, PETRI_TRANSITIONS=108} [2025-03-04 02:18:11,344 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 135 predicate places. [2025-03-04 02:18:11,344 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 108 transitions, 1687 flow [2025-03-04 02:18:11,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:11,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:11,345 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:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 02:18:11,345 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -116617391, now seen corresponding path program 15 times [2025-03-04 02:18:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205291681] [2025-03-04 02:18:11,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:11,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:11,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:11,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205291681] [2025-03-04 02:18:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205291681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226578946] [2025-03-04 02:18:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:11,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:11,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:11,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 108 transitions, 1687 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:11,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:11,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:11,711 INFO L124 PetriNetUnfolderBase]: 787/1459 cut-off events. [2025-03-04 02:18:11,711 INFO L125 PetriNetUnfolderBase]: For 8186/8225 co-relation queries the response was YES. [2025-03-04 02:18:11,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7811 conditions, 1459 events. 787/1459 cut-off events. For 8186/8225 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8300 event pairs, 289 based on Foata normal form. 4/1457 useless extension candidates. Maximal degree in co-relation 7738. Up to 893 conditions per place. [2025-03-04 02:18:11,717 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 77 selfloop transitions, 44 changer transitions 6/130 dead transitions. [2025-03-04 02:18:11,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 130 transitions, 2009 flow [2025-03-04 02:18:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-03-04 02:18:11,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4007936507936508 [2025-03-04 02:18:11,718 INFO L175 Difference]: Start difference. First operand has 161 places, 108 transitions, 1687 flow. Second operand 9 states and 101 transitions. [2025-03-04 02:18:11,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 130 transitions, 2009 flow [2025-03-04 02:18:11,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 130 transitions, 1909 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:11,734 INFO L231 Difference]: Finished difference. Result has 158 places, 105 transitions, 1614 flow [2025-03-04 02:18:11,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1614, PETRI_PLACES=158, PETRI_TRANSITIONS=105} [2025-03-04 02:18:11,735 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 132 predicate places. [2025-03-04 02:18:11,735 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 105 transitions, 1614 flow [2025-03-04 02:18:11,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:11,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:11,735 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:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 02:18:11,735 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:11,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash -53954839, now seen corresponding path program 17 times [2025-03-04 02:18:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-04 02:18:11,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:11,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:11,743 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:11,743 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-04 02:18:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605116398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809789433] [2025-03-04 02:18:11,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:11,873 INFO L229 MonitoredProcess]: Starting monitored process 20 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:11,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:18:11,923 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:11,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:11,937 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:11,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:18:11,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:12,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:18:12,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 02:18:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:12,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809789433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:12,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-04 02:18:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367763459] [2025-03-04 02:18:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:12,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:12,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:12,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:18:12,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:12,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 105 transitions, 1614 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:12,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:12,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:12,262 INFO L124 PetriNetUnfolderBase]: 751/1382 cut-off events. [2025-03-04 02:18:12,262 INFO L125 PetriNetUnfolderBase]: For 7948/7986 co-relation queries the response was YES. [2025-03-04 02:18:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7509 conditions, 1382 events. 751/1382 cut-off events. For 7948/7986 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7731 event pairs, 267 based on Foata normal form. 5/1383 useless extension candidates. Maximal degree in co-relation 7438. Up to 834 conditions per place. [2025-03-04 02:18:12,267 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 74 selfloop transitions, 44 changer transitions 4/125 dead transitions. [2025-03-04 02:18:12,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 125 transitions, 1924 flow [2025-03-04 02:18:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-04 02:18:12,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:18:12,268 INFO L175 Difference]: Start difference. First operand has 158 places, 105 transitions, 1614 flow. Second operand 9 states and 98 transitions. [2025-03-04 02:18:12,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 125 transitions, 1924 flow [2025-03-04 02:18:12,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 125 transitions, 1836 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-03-04 02:18:12,284 INFO L231 Difference]: Finished difference. Result has 153 places, 103 transitions, 1580 flow [2025-03-04 02:18:12,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1580, PETRI_PLACES=153, PETRI_TRANSITIONS=103} [2025-03-04 02:18:12,284 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 127 predicate places. [2025-03-04 02:18:12,284 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 103 transitions, 1580 flow [2025-03-04 02:18:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:12,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:12,284 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:12,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 02:18:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,485 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -763361387, now seen corresponding path program 16 times [2025-03-04 02:18:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669004377] [2025-03-04 02:18:12,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:12,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:12,492 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:12,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669004377] [2025-03-04 02:18:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669004377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:12,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:12,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708316981] [2025-03-04 02:18:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:12,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:12,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:12,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:12,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:12,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 103 transitions, 1580 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:18:12,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:12,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:12,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:12,727 INFO L124 PetriNetUnfolderBase]: 766/1406 cut-off events. [2025-03-04 02:18:12,727 INFO L125 PetriNetUnfolderBase]: For 10407/10445 co-relation queries the response was YES. [2025-03-04 02:18:12,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 1406 events. 766/1406 cut-off events. For 10407/10445 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7868 event pairs, 305 based on Foata normal form. 12/1414 useless extension candidates. Maximal degree in co-relation 7669. Up to 853 conditions per place. [2025-03-04 02:18:12,734 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 82 selfloop transitions, 43 changer transitions 0/128 dead transitions. [2025-03-04 02:18:12,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 128 transitions, 1958 flow [2025-03-04 02:18:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-03-04 02:18:12,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:18:12,735 INFO L175 Difference]: Start difference. First operand has 153 places, 103 transitions, 1580 flow. Second operand 7 states and 98 transitions. [2025-03-04 02:18:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 128 transitions, 1958 flow [2025-03-04 02:18:12,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 128 transitions, 1866 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:12,750 INFO L231 Difference]: Finished difference. Result has 153 places, 106 transitions, 1651 flow [2025-03-04 02:18:12,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1651, PETRI_PLACES=153, PETRI_TRANSITIONS=106} [2025-03-04 02:18:12,750 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 127 predicate places. [2025-03-04 02:18:12,750 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 106 transitions, 1651 flow [2025-03-04 02:18:12,750 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:18:12,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:12,750 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:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-04 02:18:12,750 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:12,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1532457057, now seen corresponding path program 17 times [2025-03-04 02:18:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:12,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543060917] [2025-03-04 02:18:12,751 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:12,754 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:12,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:12,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:12,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543060917] [2025-03-04 02:18:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543060917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336122516] [2025-03-04 02:18:12,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:12,926 INFO L229 MonitoredProcess]: Starting monitored process 21 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:12,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:18:12,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:12,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:12,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:12,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:12,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:13,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:13,166 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:13,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336122516] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:13,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 22 [2025-03-04 02:18:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966374430] [2025-03-04 02:18:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:18:13,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:13,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 106 transitions, 1651 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:18:13,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:13,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,426 INFO L124 PetriNetUnfolderBase]: 780/1460 cut-off events. [2025-03-04 02:18:13,426 INFO L125 PetriNetUnfolderBase]: For 8995/9031 co-relation queries the response was YES. [2025-03-04 02:18:13,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 1460 events. 780/1460 cut-off events. For 8995/9031 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8395 event pairs, 295 based on Foata normal form. 12/1468 useless extension candidates. Maximal degree in co-relation 7666. Up to 853 conditions per place. [2025-03-04 02:18:13,435 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 89 selfloop transitions, 41 changer transitions 1/134 dead transitions. [2025-03-04 02:18:13,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 134 transitions, 2022 flow [2025-03-04 02:18:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-03-04 02:18:13,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-03-04 02:18:13,435 INFO L175 Difference]: Start difference. First operand has 153 places, 106 transitions, 1651 flow. Second operand 7 states and 104 transitions. [2025-03-04 02:18:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 134 transitions, 2022 flow [2025-03-04 02:18:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 134 transitions, 1944 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:13,450 INFO L231 Difference]: Finished difference. Result has 156 places, 106 transitions, 1647 flow [2025-03-04 02:18:13,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1647, PETRI_PLACES=156, PETRI_TRANSITIONS=106} [2025-03-04 02:18:13,450 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 130 predicate places. [2025-03-04 02:18:13,450 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 106 transitions, 1647 flow [2025-03-04 02:18:13,451 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:18:13,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,451 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:13,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:13,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-03-04 02:18:13,651 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:13,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1707293375, now seen corresponding path program 18 times [2025-03-04 02:18:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001298931] [2025-03-04 02:18:13,651 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,655 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:13,658 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:13,658 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001298931] [2025-03-04 02:18:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001298931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429157131] [2025-03-04 02:18:13,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:13,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:13,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:13,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:13,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 106 transitions, 1647 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:13,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:13,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,970 INFO L124 PetriNetUnfolderBase]: 752/1396 cut-off events. [2025-03-04 02:18:13,970 INFO L125 PetriNetUnfolderBase]: For 7952/7986 co-relation queries the response was YES. [2025-03-04 02:18:13,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 1396 events. 752/1396 cut-off events. For 7952/7986 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7904 event pairs, 285 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 7401. Up to 846 conditions per place. [2025-03-04 02:18:13,976 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 73 selfloop transitions, 44 changer transitions 3/123 dead transitions. [2025-03-04 02:18:13,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 123 transitions, 1912 flow [2025-03-04 02:18:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-04 02:18:13,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 02:18:13,976 INFO L175 Difference]: Start difference. First operand has 156 places, 106 transitions, 1647 flow. Second operand 9 states and 102 transitions. [2025-03-04 02:18:13,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 123 transitions, 1912 flow [2025-03-04 02:18:13,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 123 transitions, 1777 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:13,989 INFO L231 Difference]: Finished difference. Result has 149 places, 104 transitions, 1554 flow [2025-03-04 02:18:13,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1554, PETRI_PLACES=149, PETRI_TRANSITIONS=104} [2025-03-04 02:18:13,989 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 123 predicate places. [2025-03-04 02:18:13,989 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 104 transitions, 1554 flow [2025-03-04 02:18:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:13,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,989 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:13,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 02:18:13,990 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1654979169, now seen corresponding path program 19 times [2025-03-04 02:18:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357817853] [2025-03-04 02:18:13,990 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:13,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:13,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:13,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357817853] [2025-03-04 02:18:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357817853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:14,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:14,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382706146] [2025-03-04 02:18:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:14,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:14,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 104 transitions, 1554 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:14,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,347 INFO L124 PetriNetUnfolderBase]: 746/1386 cut-off events. [2025-03-04 02:18:14,347 INFO L125 PetriNetUnfolderBase]: For 6809/6843 co-relation queries the response was YES. [2025-03-04 02:18:14,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7210 conditions, 1386 events. 746/1386 cut-off events. For 6809/6843 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7847 event pairs, 285 based on Foata normal form. 4/1386 useless extension candidates. Maximal degree in co-relation 7150. Up to 846 conditions per place. [2025-03-04 02:18:14,352 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 39 changer transitions 4/122 dead transitions. [2025-03-04 02:18:14,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 122 transitions, 1820 flow [2025-03-04 02:18:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-04 02:18:14,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 02:18:14,353 INFO L175 Difference]: Start difference. First operand has 149 places, 104 transitions, 1554 flow. Second operand 9 states and 102 transitions. [2025-03-04 02:18:14,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 122 transitions, 1820 flow [2025-03-04 02:18:14,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 122 transitions, 1734 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:14,363 INFO L231 Difference]: Finished difference. Result has 149 places, 101 transitions, 1484 flow [2025-03-04 02:18:14,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1484, PETRI_PLACES=149, PETRI_TRANSITIONS=101} [2025-03-04 02:18:14,364 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 123 predicate places. [2025-03-04 02:18:14,364 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 101 transitions, 1484 flow [2025-03-04 02:18:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,364 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:14,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 02:18:14,364 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:14,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash -876537755, now seen corresponding path program 20 times [2025-03-04 02:18:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63455274] [2025-03-04 02:18:14,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:14,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:14,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:14,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63455274] [2025-03-04 02:18:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63455274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:14,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545992981] [2025-03-04 02:18:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:14,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:14,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:14,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 101 transitions, 1484 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,671 INFO L124 PetriNetUnfolderBase]: 714/1304 cut-off events. [2025-03-04 02:18:14,671 INFO L125 PetriNetUnfolderBase]: For 6967/7003 co-relation queries the response was YES. [2025-03-04 02:18:14,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 1304 events. 714/1304 cut-off events. For 6967/7003 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7208 event pairs, 285 based on Foata normal form. 4/1298 useless extension candidates. Maximal degree in co-relation 6845. Up to 846 conditions per place. [2025-03-04 02:18:14,676 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 70 selfloop transitions, 39 changer transitions 3/115 dead transitions. [2025-03-04 02:18:14,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 115 transitions, 1726 flow [2025-03-04 02:18:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-04 02:18:14,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:18:14,676 INFO L175 Difference]: Start difference. First operand has 149 places, 101 transitions, 1484 flow. Second operand 9 states and 99 transitions. [2025-03-04 02:18:14,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 115 transitions, 1726 flow [2025-03-04 02:18:14,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 115 transitions, 1624 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:14,686 INFO L231 Difference]: Finished difference. Result has 144 places, 99 transitions, 1420 flow [2025-03-04 02:18:14,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1420, PETRI_PLACES=144, PETRI_TRANSITIONS=99} [2025-03-04 02:18:14,686 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 118 predicate places. [2025-03-04 02:18:14,686 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 99 transitions, 1420 flow [2025-03-04 02:18:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,686 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:14,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 02:18:14,686 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash 53949903, now seen corresponding path program 18 times [2025-03-04 02:18:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-03-04 02:18:14,687 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:14,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:18:14,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:14,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-03-04 02:18:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971346315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:14,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292442683] [2025-03-04 02:18:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:14,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:14,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:14,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 99 transitions, 1420 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,973 INFO L124 PetriNetUnfolderBase]: 682/1243 cut-off events. [2025-03-04 02:18:14,973 INFO L125 PetriNetUnfolderBase]: For 6478/6511 co-relation queries the response was YES. [2025-03-04 02:18:14,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 1243 events. 682/1243 cut-off events. For 6478/6511 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6742 event pairs, 263 based on Foata normal form. 5/1246 useless extension candidates. Maximal degree in co-relation 6601. Up to 787 conditions per place. [2025-03-04 02:18:14,978 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 70 selfloop transitions, 37 changer transitions 4/114 dead transitions. [2025-03-04 02:18:14,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 114 transitions, 1669 flow [2025-03-04 02:18:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-04 02:18:14,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:18:14,979 INFO L175 Difference]: Start difference. First operand has 144 places, 99 transitions, 1420 flow. Second operand 9 states and 99 transitions. [2025-03-04 02:18:14,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 114 transitions, 1669 flow [2025-03-04 02:18:14,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 114 transitions, 1527 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-04 02:18:14,987 INFO L231 Difference]: Finished difference. Result has 137 places, 97 transitions, 1317 flow [2025-03-04 02:18:14,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1317, PETRI_PLACES=137, PETRI_TRANSITIONS=97} [2025-03-04 02:18:14,988 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-04 02:18:14,988 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 97 transitions, 1317 flow [2025-03-04 02:18:14,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:14,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,988 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:14,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-04 02:18:14,988 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1564633043, now seen corresponding path program 19 times [2025-03-04 02:18:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986345336] [2025-03-04 02:18:14,988 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:14,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:14,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:14,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986345336] [2025-03-04 02:18:15,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986345336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:15,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:15,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416541488] [2025-03-04 02:18:15,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:15,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:15,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:15,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:15,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:15,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 97 transitions, 1317 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:15,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:15,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:15,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:15,299 INFO L124 PetriNetUnfolderBase]: 680/1234 cut-off events. [2025-03-04 02:18:15,299 INFO L125 PetriNetUnfolderBase]: For 5377/5411 co-relation queries the response was YES. [2025-03-04 02:18:15,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6487 conditions, 1234 events. 680/1234 cut-off events. For 5377/5411 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6694 event pairs, 266 based on Foata normal form. 5/1231 useless extension candidates. Maximal degree in co-relation 6431. Up to 787 conditions per place. [2025-03-04 02:18:15,303 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 66 selfloop transitions, 38 changer transitions 4/111 dead transitions. [2025-03-04 02:18:15,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 111 transitions, 1576 flow [2025-03-04 02:18:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-04 02:18:15,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.376984126984127 [2025-03-04 02:18:15,304 INFO L175 Difference]: Start difference. First operand has 137 places, 97 transitions, 1317 flow. Second operand 9 states and 95 transitions. [2025-03-04 02:18:15,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 111 transitions, 1576 flow [2025-03-04 02:18:15,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 111 transitions, 1502 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:15,312 INFO L231 Difference]: Finished difference. Result has 137 places, 96 transitions, 1310 flow [2025-03-04 02:18:15,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1310, PETRI_PLACES=137, PETRI_TRANSITIONS=96} [2025-03-04 02:18:15,312 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-04 02:18:15,312 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 96 transitions, 1310 flow [2025-03-04 02:18:15,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:15,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:15,312 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:15,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-04 02:18:15,312 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1888993589, now seen corresponding path program 20 times [2025-03-04 02:18:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749020828] [2025-03-04 02:18:15,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:15,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:18:15,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:15,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:15,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749020828] [2025-03-04 02:18:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749020828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:15,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:15,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171288107] [2025-03-04 02:18:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:15,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:15,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:15,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:15,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 96 transitions, 1310 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:15,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:15,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:15,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:15,601 INFO L124 PetriNetUnfolderBase]: 648/1171 cut-off events. [2025-03-04 02:18:15,601 INFO L125 PetriNetUnfolderBase]: For 5059/5091 co-relation queries the response was YES. [2025-03-04 02:18:15,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 1171 events. 648/1171 cut-off events. For 5059/5091 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6257 event pairs, 241 based on Foata normal form. 5/1176 useless extension candidates. Maximal degree in co-relation 6218. Up to 728 conditions per place. [2025-03-04 02:18:15,605 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 63 selfloop transitions, 35 changer transitions 8/109 dead transitions. [2025-03-04 02:18:15,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 109 transitions, 1546 flow [2025-03-04 02:18:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-03-04 02:18:15,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2025-03-04 02:18:15,606 INFO L175 Difference]: Start difference. First operand has 137 places, 96 transitions, 1310 flow. Second operand 9 states and 93 transitions. [2025-03-04 02:18:15,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 109 transitions, 1546 flow [2025-03-04 02:18:15,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 109 transitions, 1468 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:15,614 INFO L231 Difference]: Finished difference. Result has 136 places, 93 transitions, 1256 flow [2025-03-04 02:18:15,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1256, PETRI_PLACES=136, PETRI_TRANSITIONS=93} [2025-03-04 02:18:15,614 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2025-03-04 02:18:15,614 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 93 transitions, 1256 flow [2025-03-04 02:18:15,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:15,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:15,614 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] [2025-03-04 02:18:15,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-04 02:18:15,615 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:15,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -377775210, now seen corresponding path program 1 times [2025-03-04 02:18:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869908028] [2025-03-04 02:18:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:15,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:15,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869908028] [2025-03-04 02:18:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869908028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412932773] [2025-03-04 02:18:15,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:15,722 INFO L229 MonitoredProcess]: Starting monitored process 22 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:15,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:18:15,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:18:15,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:18:15,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:15,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:15,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:15,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412932773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:15,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 02:18:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365360134] [2025-03-04 02:18:15,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:18:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:18:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:18:16,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:16,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 93 transitions, 1256 flow. Second operand has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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:16,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:16,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:16,398 INFO L124 PetriNetUnfolderBase]: 1921/3451 cut-off events. [2025-03-04 02:18:16,398 INFO L125 PetriNetUnfolderBase]: For 14784/14882 co-relation queries the response was YES. [2025-03-04 02:18:16,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18459 conditions, 3451 events. 1921/3451 cut-off events. For 14784/14882 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 22834 event pairs, 473 based on Foata normal form. 1/3452 useless extension candidates. Maximal degree in co-relation 17087. Up to 1088 conditions per place. [2025-03-04 02:18:16,412 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 302 selfloop transitions, 17 changer transitions 1/323 dead transitions. [2025-03-04 02:18:16,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 323 transitions, 4871 flow [2025-03-04 02:18:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:18:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:18:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2025-03-04 02:18:16,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4478021978021978 [2025-03-04 02:18:16,413 INFO L175 Difference]: Start difference. First operand has 136 places, 93 transitions, 1256 flow. Second operand 13 states and 163 transitions. [2025-03-04 02:18:16,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 323 transitions, 4871 flow [2025-03-04 02:18:16,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 323 transitions, 4361 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 02:18:16,434 INFO L231 Difference]: Finished difference. Result has 137 places, 108 transitions, 1289 flow [2025-03-04 02:18:16,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1289, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2025-03-04 02:18:16,434 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-04 02:18:16,434 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 1289 flow [2025-03-04 02:18:16,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 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:16,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:16,434 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:16,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-04 02:18:16,634 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1502027538, now seen corresponding path program 2 times [2025-03-04 02:18:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739846557] [2025-03-04 02:18:16,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:16,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:18:16,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 24 statements. [2025-03-04 02:18:16,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,663 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:16,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:16,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739846557] [2025-03-04 02:18:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739846557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:16,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439868808] [2025-03-04 02:18:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:16,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:16,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 1289 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:16,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:16,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:16,912 INFO L124 PetriNetUnfolderBase]: 2050/3674 cut-off events. [2025-03-04 02:18:16,912 INFO L125 PetriNetUnfolderBase]: For 12256/12367 co-relation queries the response was YES. [2025-03-04 02:18:16,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18707 conditions, 3674 events. 2050/3674 cut-off events. For 12256/12367 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 24597 event pairs, 237 based on Foata normal form. 2/3676 useless extension candidates. Maximal degree in co-relation 16612. Up to 1634 conditions per place. [2025-03-04 02:18:16,929 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 132 selfloop transitions, 20 changer transitions 1/156 dead transitions. [2025-03-04 02:18:16,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 1977 flow [2025-03-04 02:18:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 02:18:16,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:18:16,930 INFO L175 Difference]: Start difference. First operand has 137 places, 108 transitions, 1289 flow. Second operand 5 states and 76 transitions. [2025-03-04 02:18:16,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 1977 flow [2025-03-04 02:18:16,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 156 transitions, 1940 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:16,951 INFO L231 Difference]: Finished difference. Result has 141 places, 113 transitions, 1379 flow [2025-03-04 02:18:16,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1379, PETRI_PLACES=141, PETRI_TRANSITIONS=113} [2025-03-04 02:18:16,951 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 115 predicate places. [2025-03-04 02:18:16,951 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 113 transitions, 1379 flow [2025-03-04 02:18:16,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:16,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:16,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:16,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-04 02:18:16,952 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:16,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 521178094, now seen corresponding path program 3 times [2025-03-04 02:18:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70698752] [2025-03-04 02:18:16,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:16,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:18:16,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-04 02:18:16,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:16,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:18:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70698752] [2025-03-04 02:18:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70698752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059164444] [2025-03-04 02:18:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:16,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:16,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:16,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 113 transitions, 1379 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:16,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:16,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:17,231 INFO L124 PetriNetUnfolderBase]: 2050/3666 cut-off events. [2025-03-04 02:18:17,231 INFO L125 PetriNetUnfolderBase]: For 15145/15254 co-relation queries the response was YES. [2025-03-04 02:18:17,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19218 conditions, 3666 events. 2050/3666 cut-off events. For 15145/15254 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 24278 event pairs, 224 based on Foata normal form. 2/3668 useless extension candidates. Maximal degree in co-relation 17081. Up to 1680 conditions per place. [2025-03-04 02:18:17,249 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 131 selfloop transitions, 22 changer transitions 1/157 dead transitions. [2025-03-04 02:18:17,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 157 transitions, 2057 flow [2025-03-04 02:18:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-04 02:18:17,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-04 02:18:17,250 INFO L175 Difference]: Start difference. First operand has 141 places, 113 transitions, 1379 flow. Second operand 5 states and 74 transitions. [2025-03-04 02:18:17,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 157 transitions, 2057 flow [2025-03-04 02:18:17,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 157 transitions, 2022 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:17,273 INFO L231 Difference]: Finished difference. Result has 145 places, 118 transitions, 1481 flow [2025-03-04 02:18:17,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1481, PETRI_PLACES=145, PETRI_TRANSITIONS=118} [2025-03-04 02:18:17,273 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 119 predicate places. [2025-03-04 02:18:17,273 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 118 transitions, 1481 flow [2025-03-04 02:18:17,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:17,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:17,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-04 02:18:17,274 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 949670899, now seen corresponding path program 1 times [2025-03-04 02:18:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404291913] [2025-03-04 02:18:17,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:17,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:17,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:17,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:17,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404291913] [2025-03-04 02:18:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404291913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686286654] [2025-03-04 02:18:17,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:17,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:17,317 INFO L229 MonitoredProcess]: Starting monitored process 23 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:17,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:18:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:17,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:18:17,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:17,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686286654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:17,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 02:18:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059372812] [2025-03-04 02:18:17,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:17,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:18:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:17,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:18:17,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:18:17,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:17,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 118 transitions, 1481 flow. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 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:17,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:17,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:17,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:17,937 INFO L124 PetriNetUnfolderBase]: 2398/4538 cut-off events. [2025-03-04 02:18:17,938 INFO L125 PetriNetUnfolderBase]: For 21455/21608 co-relation queries the response was YES. [2025-03-04 02:18:17,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24437 conditions, 4538 events. 2398/4538 cut-off events. For 21455/21608 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 33427 event pairs, 596 based on Foata normal form. 196/4734 useless extension candidates. Maximal degree in co-relation 23347. Up to 1161 conditions per place. [2025-03-04 02:18:17,959 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 308 selfloop transitions, 87 changer transitions 0/398 dead transitions. [2025-03-04 02:18:17,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 398 transitions, 5778 flow [2025-03-04 02:18:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:18:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:18:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 211 transitions. [2025-03-04 02:18:17,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4432773109243697 [2025-03-04 02:18:17,959 INFO L175 Difference]: Start difference. First operand has 145 places, 118 transitions, 1481 flow. Second operand 17 states and 211 transitions. [2025-03-04 02:18:17,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 398 transitions, 5778 flow [2025-03-04 02:18:17,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 398 transitions, 5639 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:17,993 INFO L231 Difference]: Finished difference. Result has 160 places, 190 transitions, 2888 flow [2025-03-04 02:18:17,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2888, PETRI_PLACES=160, PETRI_TRANSITIONS=190} [2025-03-04 02:18:17,994 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 134 predicate places. [2025-03-04 02:18:17,994 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 190 transitions, 2888 flow [2025-03-04 02:18:17,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 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:17,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:17,994 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:17,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 02:18:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:18,194 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:18,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1736774005, now seen corresponding path program 1 times [2025-03-04 02:18:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583536776] [2025-03-04 02:18:18,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:18,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:18,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:18,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:18,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583536776] [2025-03-04 02:18:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583536776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934628343] [2025-03-04 02:18:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:18,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:18,293 INFO L229 MonitoredProcess]: Starting monitored process 24 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:18,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:18:18,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:18,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:18,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:18,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:18,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:18:18,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:18,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934628343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:18,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:18,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-04 02:18:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657762936] [2025-03-04 02:18:18,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:18,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:18:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:18,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:18:18,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:18:18,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:18,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 190 transitions, 2888 flow. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 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:18,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:18,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:18,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:18,992 INFO L124 PetriNetUnfolderBase]: 1530/3100 cut-off events. [2025-03-04 02:18:18,992 INFO L125 PetriNetUnfolderBase]: For 17250/17361 co-relation queries the response was YES. [2025-03-04 02:18:18,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17245 conditions, 3100 events. 1530/3100 cut-off events. For 17250/17361 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 22999 event pairs, 500 based on Foata normal form. 160/3260 useless extension candidates. Maximal degree in co-relation 15256. Up to 1161 conditions per place. [2025-03-04 02:18:19,002 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 92 selfloop transitions, 6 changer transitions 264/365 dead transitions. [2025-03-04 02:18:19,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 365 transitions, 5545 flow [2025-03-04 02:18:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:18:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:18:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 205 transitions. [2025-03-04 02:18:19,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43067226890756305 [2025-03-04 02:18:19,003 INFO L175 Difference]: Start difference. First operand has 160 places, 190 transitions, 2888 flow. Second operand 17 states and 205 transitions. [2025-03-04 02:18:19,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 365 transitions, 5545 flow [2025-03-04 02:18:19,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 365 transitions, 5515 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:19,043 INFO L231 Difference]: Finished difference. Result has 178 places, 101 transitions, 1462 flow [2025-03-04 02:18:19,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2765, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1462, PETRI_PLACES=178, PETRI_TRANSITIONS=101} [2025-03-04 02:18:19,045 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 152 predicate places. [2025-03-04 02:18:19,045 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 101 transitions, 1462 flow [2025-03-04 02:18:19,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 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:19,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:19,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:19,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:19,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:19,246 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash -550720774, now seen corresponding path program 2 times [2025-03-04 02:18:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:19,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859045286] [2025-03-04 02:18:19,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:19,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:19,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:19,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:19,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859045286] [2025-03-04 02:18:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859045286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143614709] [2025-03-04 02:18:19,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:19,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:19,350 INFO L229 MonitoredProcess]: Starting monitored process 25 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:19,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 02:18:19,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:19,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:19,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:19,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:18:19,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:19,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143614709] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2025-03-04 02:18:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889908271] [2025-03-04 02:18:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:19,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:19,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:18:19,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:19,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 101 transitions, 1462 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:19,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:19,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:19,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:19,868 INFO L124 PetriNetUnfolderBase]: 1238/2153 cut-off events. [2025-03-04 02:18:19,868 INFO L125 PetriNetUnfolderBase]: For 13517/13560 co-relation queries the response was YES. [2025-03-04 02:18:19,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11784 conditions, 2153 events. 1238/2153 cut-off events. For 13517/13560 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12353 event pairs, 287 based on Foata normal form. 5/2158 useless extension candidates. Maximal degree in co-relation 11700. Up to 875 conditions per place. [2025-03-04 02:18:19,878 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 136 selfloop transitions, 30 changer transitions 13/181 dead transitions. [2025-03-04 02:18:19,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 181 transitions, 2536 flow [2025-03-04 02:18:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:18:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:18:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-04 02:18:19,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-04 02:18:19,879 INFO L175 Difference]: Start difference. First operand has 178 places, 101 transitions, 1462 flow. Second operand 10 states and 114 transitions. [2025-03-04 02:18:19,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 181 transitions, 2536 flow [2025-03-04 02:18:19,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 181 transitions, 2209 flow, removed 156 selfloop flow, removed 20 redundant places. [2025-03-04 02:18:19,898 INFO L231 Difference]: Finished difference. Result has 145 places, 103 transitions, 1330 flow [2025-03-04 02:18:19,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1330, PETRI_PLACES=145, PETRI_TRANSITIONS=103} [2025-03-04 02:18:19,899 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 119 predicate places. [2025-03-04 02:18:19,899 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 103 transitions, 1330 flow [2025-03-04 02:18:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:19,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:19,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 02:18:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:20,100 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 90673136, now seen corresponding path program 3 times [2025-03-04 02:18:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628327657] [2025-03-04 02:18:20,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:20,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:20,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:20,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628327657] [2025-03-04 02:18:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628327657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815637221] [2025-03-04 02:18:20,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:20,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:20,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:20,149 INFO L229 MonitoredProcess]: Starting monitored process 26 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:20,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 02:18:20,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:20,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:20,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:20,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:20,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:20,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815637221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:20,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:18:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348750716] [2025-03-04 02:18:20,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:18:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:20,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:18:20,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:18:20,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:18:20,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 103 transitions, 1330 flow. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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:20,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:20,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:18:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:20,808 INFO L124 PetriNetUnfolderBase]: 1810/3161 cut-off events. [2025-03-04 02:18:20,808 INFO L125 PetriNetUnfolderBase]: For 10714/10714 co-relation queries the response was YES. [2025-03-04 02:18:20,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14482 conditions, 3161 events. 1810/3161 cut-off events. For 10714/10714 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18842 event pairs, 202 based on Foata normal form. 24/3185 useless extension candidates. Maximal degree in co-relation 14410. Up to 557 conditions per place. [2025-03-04 02:18:20,821 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 243 selfloop transitions, 89 changer transitions 2/335 dead transitions. [2025-03-04 02:18:20,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 335 transitions, 3610 flow [2025-03-04 02:18:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:18:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:18:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 274 transitions. [2025-03-04 02:18:20,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2025-03-04 02:18:20,823 INFO L175 Difference]: Start difference. First operand has 145 places, 103 transitions, 1330 flow. Second operand 21 states and 274 transitions. [2025-03-04 02:18:20,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 335 transitions, 3610 flow [2025-03-04 02:18:20,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 335 transitions, 3499 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:20,843 INFO L231 Difference]: Finished difference. Result has 169 places, 151 transitions, 2166 flow [2025-03-04 02:18:20,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2166, PETRI_PLACES=169, PETRI_TRANSITIONS=151} [2025-03-04 02:18:20,855 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 143 predicate places. [2025-03-04 02:18:20,855 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 151 transitions, 2166 flow [2025-03-04 02:18:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:20,855 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:20,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 02:18:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-03-04 02:18:21,056 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2086867352, now seen corresponding path program 2 times [2025-03-04 02:18:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054109817] [2025-03-04 02:18:21,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:21,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:21,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:21,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:21,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054109817] [2025-03-04 02:18:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054109817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974900468] [2025-03-04 02:18:21,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:21,180 INFO L229 MonitoredProcess]: Starting monitored process 27 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:21,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 02:18:21,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:21,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:21,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:21,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:18:21,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:21,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974900468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:21,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-04 02:18:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278020955] [2025-03-04 02:18:21,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:21,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:18:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:21,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:18:21,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:18:21,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:21,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 151 transitions, 2166 flow. Second operand has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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:21,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:21,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:21,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:21,976 INFO L124 PetriNetUnfolderBase]: 2023/3615 cut-off events. [2025-03-04 02:18:21,976 INFO L125 PetriNetUnfolderBase]: For 20060/20146 co-relation queries the response was YES. [2025-03-04 02:18:21,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18936 conditions, 3615 events. 2023/3615 cut-off events. For 20060/20146 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22647 event pairs, 462 based on Foata normal form. 85/3694 useless extension candidates. Maximal degree in co-relation 18856. Up to 1113 conditions per place. [2025-03-04 02:18:21,993 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 178 selfloop transitions, 55 changer transitions 0/236 dead transitions. [2025-03-04 02:18:21,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 236 transitions, 3590 flow [2025-03-04 02:18:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2025-03-04 02:18:21,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-03-04 02:18:21,994 INFO L175 Difference]: Start difference. First operand has 169 places, 151 transitions, 2166 flow. Second operand 12 states and 108 transitions. [2025-03-04 02:18:21,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 236 transitions, 3590 flow [2025-03-04 02:18:22,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 236 transitions, 3397 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:22,025 INFO L231 Difference]: Finished difference. Result has 174 places, 155 transitions, 2250 flow [2025-03-04 02:18:22,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2250, PETRI_PLACES=174, PETRI_TRANSITIONS=155} [2025-03-04 02:18:22,026 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 148 predicate places. [2025-03-04 02:18:22,026 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 155 transitions, 2250 flow [2025-03-04 02:18:22,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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:22,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:22,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:22,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 02:18:22,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-03-04 02:18:22,226 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 988667838, now seen corresponding path program 4 times [2025-03-04 02:18:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717378707] [2025-03-04 02:18:22,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:22,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:22,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-04 02:18:22,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:22,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:22,260 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:18:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717378707] [2025-03-04 02:18:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717378707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817731170] [2025-03-04 02:18:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:22,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:18:22,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 155 transitions, 2250 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:22,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:22,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:18:22,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:22,834 INFO L124 PetriNetUnfolderBase]: 2418/4252 cut-off events. [2025-03-04 02:18:22,834 INFO L125 PetriNetUnfolderBase]: For 24486/24486 co-relation queries the response was YES. [2025-03-04 02:18:22,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22651 conditions, 4252 events. 2418/4252 cut-off events. For 24486/24486 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 26584 event pairs, 716 based on Foata normal form. 10/4262 useless extension candidates. Maximal degree in co-relation 22569. Up to 1483 conditions per place. [2025-03-04 02:18:22,852 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 210 selfloop transitions, 83 changer transitions 6/300 dead transitions. [2025-03-04 02:18:22,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 300 transitions, 4028 flow [2025-03-04 02:18:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:18:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:18:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2025-03-04 02:18:22,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46703296703296704 [2025-03-04 02:18:22,853 INFO L175 Difference]: Start difference. First operand has 174 places, 155 transitions, 2250 flow. Second operand 13 states and 170 transitions. [2025-03-04 02:18:22,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 300 transitions, 4028 flow [2025-03-04 02:18:22,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 300 transitions, 3911 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-04 02:18:22,896 INFO L231 Difference]: Finished difference. Result has 183 places, 188 transitions, 2818 flow [2025-03-04 02:18:22,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2818, PETRI_PLACES=183, PETRI_TRANSITIONS=188} [2025-03-04 02:18:22,897 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 157 predicate places. [2025-03-04 02:18:22,897 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 2818 flow [2025-03-04 02:18:22,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:22,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:22,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:22,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-04 02:18:22,897 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:22,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1812987746, now seen corresponding path program 5 times [2025-03-04 02:18:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:22,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-03-04 02:18:22,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:22,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:22,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:22,907 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:22,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603386289] [2025-03-04 02:18:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603386289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222950688] [2025-03-04 02:18:22,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:22,976 INFO L229 MonitoredProcess]: Starting monitored process 28 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:22,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 02:18:23,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:18:23,060 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:18:23,060 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:23,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:23,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:18:23,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:23,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222950688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:23,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:18:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535013076] [2025-03-04 02:18:23,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:23,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:18:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:23,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:18:23,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:18:23,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:18:23,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 2818 flow. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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:23,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:23,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:18:23,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:23,904 INFO L124 PetriNetUnfolderBase]: 2323/4058 cut-off events. [2025-03-04 02:18:23,904 INFO L125 PetriNetUnfolderBase]: For 27738/27738 co-relation queries the response was YES. [2025-03-04 02:18:23,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22659 conditions, 4058 events. 2323/4058 cut-off events. For 27738/27738 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24934 event pairs, 502 based on Foata normal form. 70/4128 useless extension candidates. Maximal degree in co-relation 22578. Up to 1080 conditions per place. [2025-03-04 02:18:23,929 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 198 selfloop transitions, 110 changer transitions 0/309 dead transitions. [2025-03-04 02:18:23,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 309 transitions, 4596 flow [2025-03-04 02:18:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:18:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:18:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 161 transitions. [2025-03-04 02:18:23,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-03-04 02:18:23,930 INFO L175 Difference]: Start difference. First operand has 183 places, 188 transitions, 2818 flow. Second operand 16 states and 161 transitions. [2025-03-04 02:18:23,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 309 transitions, 4596 flow [2025-03-04 02:18:23,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 309 transitions, 4431 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:23,998 INFO L231 Difference]: Finished difference. Result has 192 places, 198 transitions, 3141 flow [2025-03-04 02:18:23,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2681, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3141, PETRI_PLACES=192, PETRI_TRANSITIONS=198} [2025-03-04 02:18:23,999 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 166 predicate places. [2025-03-04 02:18:23,999 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 198 transitions, 3141 flow [2025-03-04 02:18:23,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 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:23,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:23,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:24,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-03-04 02:18:24,199 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -238089059, now seen corresponding path program 1 times [2025-03-04 02:18:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681886349] [2025-03-04 02:18:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:24,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:24,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:24,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:24,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681886349] [2025-03-04 02:18:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681886349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037413419] [2025-03-04 02:18:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:24,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:24,621 INFO L229 MonitoredProcess]: Starting monitored process 29 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:24,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 02:18:24,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:24,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:24,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:24,849 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:18:24,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 24 [2025-03-04 02:18:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:24,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:25,046 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-04 02:18:25,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 70 [2025-03-04 02:18:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037413419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:25,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2025-03-04 02:18:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301772421] [2025-03-04 02:18:25,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:18:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:18:25,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:18:25,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:25,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 198 transitions, 3141 flow. Second operand has 25 states, 25 states have (on average 7.32) internal successors, (183), 25 states have internal predecessors, (183), 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:25,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:25,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:25,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:26,033 INFO L124 PetriNetUnfolderBase]: 2118/3798 cut-off events. [2025-03-04 02:18:26,033 INFO L125 PetriNetUnfolderBase]: For 28964/29058 co-relation queries the response was YES. [2025-03-04 02:18:26,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21699 conditions, 3798 events. 2118/3798 cut-off events. For 28964/29058 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 24477 event pairs, 537 based on Foata normal form. 12/3792 useless extension candidates. Maximal degree in co-relation 21616. Up to 1585 conditions per place. [2025-03-04 02:18:26,062 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 184 selfloop transitions, 78 changer transitions 21/297 dead transitions. [2025-03-04 02:18:26,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 297 transitions, 4642 flow [2025-03-04 02:18:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:18:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:18:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 167 transitions. [2025-03-04 02:18:26,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37276785714285715 [2025-03-04 02:18:26,063 INFO L175 Difference]: Start difference. First operand has 192 places, 198 transitions, 3141 flow. Second operand 16 states and 167 transitions. [2025-03-04 02:18:26,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 297 transitions, 4642 flow [2025-03-04 02:18:26,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 297 transitions, 4599 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:26,128 INFO L231 Difference]: Finished difference. Result has 205 places, 200 transitions, 3312 flow [2025-03-04 02:18:26,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3114, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3312, PETRI_PLACES=205, PETRI_TRANSITIONS=200} [2025-03-04 02:18:26,128 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 179 predicate places. [2025-03-04 02:18:26,128 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 200 transitions, 3312 flow [2025-03-04 02:18:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.32) internal successors, (183), 25 states have internal predecessors, (183), 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:26,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:26,128 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:26,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 02:18:26,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:26,329 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1504747097, now seen corresponding path program 2 times [2025-03-04 02:18:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934872368] [2025-03-04 02:18:26,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:26,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:26,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:26,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934872368] [2025-03-04 02:18:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934872368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739970582] [2025-03-04 02:18:26,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:26,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:26,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:26,616 INFO L229 MonitoredProcess]: Starting monitored process 30 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:26,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 02:18:26,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:26,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:26,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:26,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:26,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:18:26,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:26,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:18:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:18:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:18:26,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:27,015 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:27,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2025-03-04 02:18:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739970582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:27,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 33 [2025-03-04 02:18:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820995663] [2025-03-04 02:18:27,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 02:18:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 02:18:27,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:18:27,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:27,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 200 transitions, 3312 flow. Second operand has 33 states, 33 states have (on average 7.242424242424242) internal successors, (239), 33 states have internal predecessors, (239), 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:27,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:27,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:29,426 INFO L124 PetriNetUnfolderBase]: 5249/9648 cut-off events. [2025-03-04 02:18:29,426 INFO L125 PetriNetUnfolderBase]: For 73242/73497 co-relation queries the response was YES. [2025-03-04 02:18:29,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54746 conditions, 9648 events. 5249/9648 cut-off events. For 73242/73497 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 74035 event pairs, 769 based on Foata normal form. 10/9637 useless extension candidates. Maximal degree in co-relation 54111. Up to 1697 conditions per place. [2025-03-04 02:18:29,499 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 432 selfloop transitions, 283 changer transitions 25/754 dead transitions. [2025-03-04 02:18:29,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 754 transitions, 11111 flow [2025-03-04 02:18:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 02:18:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 02:18:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 588 transitions. [2025-03-04 02:18:29,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-04 02:18:29,501 INFO L175 Difference]: Start difference. First operand has 205 places, 200 transitions, 3312 flow. Second operand 48 states and 588 transitions. [2025-03-04 02:18:29,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 754 transitions, 11111 flow [2025-03-04 02:18:29,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 754 transitions, 10495 flow, removed 106 selfloop flow, removed 13 redundant places. [2025-03-04 02:18:29,694 INFO L231 Difference]: Finished difference. Result has 261 places, 393 transitions, 7209 flow [2025-03-04 02:18:29,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=7209, PETRI_PLACES=261, PETRI_TRANSITIONS=393} [2025-03-04 02:18:29,694 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 235 predicate places. [2025-03-04 02:18:29,694 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 393 transitions, 7209 flow [2025-03-04 02:18:29,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.242424242424242) internal successors, (239), 33 states have internal predecessors, (239), 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:29,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:29,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:29,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 02:18:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:29,895 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1487153441, now seen corresponding path program 3 times [2025-03-04 02:18:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:29,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173376888] [2025-03-04 02:18:29,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:29,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:29,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:29,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173376888] [2025-03-04 02:18:30,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173376888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338452420] [2025-03-04 02:18:30,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:30,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:30,243 INFO L229 MonitoredProcess]: Starting monitored process 31 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:30,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 02:18:30,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:30,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:30,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:30,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:18:30,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:30,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:18:30,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:18:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:18:30,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:30,711 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-04 02:18:30,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 70 [2025-03-04 02:18:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338452420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:30,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 31 [2025-03-04 02:18:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689935511] [2025-03-04 02:18:30,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 02:18:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:30,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 02:18:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-03-04 02:18:30,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:30,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 393 transitions, 7209 flow. Second operand has 31 states, 31 states have (on average 7.387096774193548) internal successors, (229), 31 states have internal predecessors, (229), 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:30,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:30,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:33,090 INFO L124 PetriNetUnfolderBase]: 5219/9556 cut-off events. [2025-03-04 02:18:33,091 INFO L125 PetriNetUnfolderBase]: For 112046/112321 co-relation queries the response was YES. [2025-03-04 02:18:33,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60194 conditions, 9556 events. 5219/9556 cut-off events. For 112046/112321 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 73615 event pairs, 665 based on Foata normal form. 19/9560 useless extension candidates. Maximal degree in co-relation 59252. Up to 2071 conditions per place. [2025-03-04 02:18:33,165 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 461 selfloop transitions, 238 changer transitions 15/728 dead transitions. [2025-03-04 02:18:33,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 728 transitions, 12829 flow [2025-03-04 02:18:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:18:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:18:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 363 transitions. [2025-03-04 02:18:33,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:18:33,166 INFO L175 Difference]: Start difference. First operand has 261 places, 393 transitions, 7209 flow. Second operand 33 states and 363 transitions. [2025-03-04 02:18:33,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 728 transitions, 12829 flow [2025-03-04 02:18:33,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 728 transitions, 12350 flow, removed 181 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:33,566 INFO L231 Difference]: Finished difference. Result has 284 places, 421 transitions, 7964 flow [2025-03-04 02:18:33,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6930, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7964, PETRI_PLACES=284, PETRI_TRANSITIONS=421} [2025-03-04 02:18:33,567 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 258 predicate places. [2025-03-04 02:18:33,567 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 421 transitions, 7964 flow [2025-03-04 02:18:33,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.387096774193548) internal successors, (229), 31 states have internal predecessors, (229), 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:33,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:33,568 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:33,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 02:18:33,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2025-03-04 02:18:33,768 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1041535459, now seen corresponding path program 4 times [2025-03-04 02:18:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-03-04 02:18:33,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:33,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:33,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:33,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:33,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-03-04 02:18:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849004017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870253166] [2025-03-04 02:18:33,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:33,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:33,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:33,865 INFO L229 MonitoredProcess]: Starting monitored process 32 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:33,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 02:18:33,934 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:33,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:33,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:33,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:33,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:18:33,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:34,097 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:18:34,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 24 [2025-03-04 02:18:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:34,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:34,232 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:34,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2025-03-04 02:18:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870253166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:34,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 22 [2025-03-04 02:18:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212785676] [2025-03-04 02:18:34,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:18:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:34,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:18:34,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:18:34,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:34,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 421 transitions, 7964 flow. Second operand has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 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:34,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:34,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:34,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:36,916 INFO L124 PetriNetUnfolderBase]: 5486/10079 cut-off events. [2025-03-04 02:18:36,916 INFO L125 PetriNetUnfolderBase]: For 122968/123278 co-relation queries the response was YES. [2025-03-04 02:18:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64226 conditions, 10079 events. 5486/10079 cut-off events. For 122968/123278 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 77767 event pairs, 1099 based on Foata normal form. 6/10042 useless extension candidates. Maximal degree in co-relation 63416. Up to 4327 conditions per place. [2025-03-04 02:18:37,003 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 303 selfloop transitions, 253 changer transitions 14/584 dead transitions. [2025-03-04 02:18:37,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 584 transitions, 10686 flow [2025-03-04 02:18:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 279 transitions. [2025-03-04 02:18:37,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2025-03-04 02:18:37,004 INFO L175 Difference]: Start difference. First operand has 284 places, 421 transitions, 7964 flow. Second operand 24 states and 279 transitions. [2025-03-04 02:18:37,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 584 transitions, 10686 flow [2025-03-04 02:18:37,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 584 transitions, 10352 flow, removed 59 selfloop flow, removed 16 redundant places. [2025-03-04 02:18:37,483 INFO L231 Difference]: Finished difference. Result has 298 places, 456 transitions, 8891 flow [2025-03-04 02:18:37,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7684, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8891, PETRI_PLACES=298, PETRI_TRANSITIONS=456} [2025-03-04 02:18:37,483 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 272 predicate places. [2025-03-04 02:18:37,484 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 456 transitions, 8891 flow [2025-03-04 02:18:37,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 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:37,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:37,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:37,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 02:18:37,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:37,688 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 308213081, now seen corresponding path program 5 times [2025-03-04 02:18:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182241138] [2025-03-04 02:18:37,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:37,693 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:37,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:37,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:37,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182241138] [2025-03-04 02:18:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182241138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648976340] [2025-03-04 02:18:37,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:37,962 INFO L229 MonitoredProcess]: Starting monitored process 33 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:37,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 02:18:38,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:38,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:38,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:38,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:18:38,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:38,229 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:18:38,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:18:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:18:38,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:38,381 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:18:38,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 78 [2025-03-04 02:18:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648976340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:38,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 26 [2025-03-04 02:18:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898890928] [2025-03-04 02:18:38,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:18:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:38,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:18:38,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:18:38,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:38,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 456 transitions, 8891 flow. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 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:38,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:38,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:38,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:40,954 INFO L124 PetriNetUnfolderBase]: 6139/11394 cut-off events. [2025-03-04 02:18:40,954 INFO L125 PetriNetUnfolderBase]: For 143912/144262 co-relation queries the response was YES. [2025-03-04 02:18:41,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73110 conditions, 11394 events. 6139/11394 cut-off events. For 143912/144262 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 90814 event pairs, 2934 based on Foata normal form. 22/11381 useless extension candidates. Maximal degree in co-relation 72378. Up to 8228 conditions per place. [2025-03-04 02:18:41,047 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 423 selfloop transitions, 172 changer transitions 40/649 dead transitions. [2025-03-04 02:18:41,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 649 transitions, 12640 flow [2025-03-04 02:18:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2025-03-04 02:18:41,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-03-04 02:18:41,049 INFO L175 Difference]: Start difference. First operand has 298 places, 456 transitions, 8891 flow. Second operand 24 states and 256 transitions. [2025-03-04 02:18:41,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 649 transitions, 12640 flow [2025-03-04 02:18:41,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 649 transitions, 12386 flow, removed 25 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:41,590 INFO L231 Difference]: Finished difference. Result has 320 places, 514 transitions, 10324 flow [2025-03-04 02:18:41,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8673, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=10324, PETRI_PLACES=320, PETRI_TRANSITIONS=514} [2025-03-04 02:18:41,591 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 294 predicate places. [2025-03-04 02:18:41,591 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 514 transitions, 10324 flow [2025-03-04 02:18:41,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 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:41,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:41,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:41,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 02:18:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:41,792 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1847405293, now seen corresponding path program 6 times [2025-03-04 02:18:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831673819] [2025-03-04 02:18:41,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:41,797 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:41,802 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-03-04 02:18:41,802 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:41,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:42,010 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:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831673819] [2025-03-04 02:18:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831673819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:18:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976119318] [2025-03-04 02:18:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:42,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:18:42,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:42,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:18:42,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:18:42,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:42,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 514 transitions, 10324 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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:42,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:42,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:42,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:44,522 INFO L124 PetriNetUnfolderBase]: 6001/11088 cut-off events. [2025-03-04 02:18:44,522 INFO L125 PetriNetUnfolderBase]: For 160504/160872 co-relation queries the response was YES. [2025-03-04 02:18:44,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74621 conditions, 11088 events. 6001/11088 cut-off events. For 160504/160872 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 87603 event pairs, 3196 based on Foata normal form. 4/11023 useless extension candidates. Maximal degree in co-relation 73890. Up to 9118 conditions per place. [2025-03-04 02:18:44,663 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 389 selfloop transitions, 150 changer transitions 7/560 dead transitions. [2025-03-04 02:18:44,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 560 transitions, 11996 flow [2025-03-04 02:18:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2025-03-04 02:18:44,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2025-03-04 02:18:44,668 INFO L175 Difference]: Start difference. First operand has 320 places, 514 transitions, 10324 flow. Second operand 12 states and 124 transitions. [2025-03-04 02:18:44,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 560 transitions, 11996 flow [2025-03-04 02:18:45,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 560 transitions, 11808 flow, removed 74 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:45,475 INFO L231 Difference]: Finished difference. Result has 318 places, 528 transitions, 10842 flow [2025-03-04 02:18:45,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10136, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10842, PETRI_PLACES=318, PETRI_TRANSITIONS=528} [2025-03-04 02:18:45,476 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 292 predicate places. [2025-03-04 02:18:45,476 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 528 transitions, 10842 flow [2025-03-04 02:18:45,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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:45,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:45,476 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-04 02:18:45,476 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:45,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1355031117, now seen corresponding path program 7 times [2025-03-04 02:18:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073436747] [2025-03-04 02:18:45,477 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:45,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:45,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:45,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:45,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073436747] [2025-03-04 02:18:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073436747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830286180] [2025-03-04 02:18:45,774 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:45,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:45,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:45,777 INFO L229 MonitoredProcess]: Starting monitored process 34 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:45,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 02:18:45,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:45,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:45,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:45,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:45,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:18:45,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:45,951 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:18:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 24 [2025-03-04 02:18:45,971 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:18:45,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:46,143 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:18:46,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 78 [2025-03-04 02:18:46,191 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:18:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830286180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:46,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-03-04 02:18:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930352397] [2025-03-04 02:18:46,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:18:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:18:46,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:18:46,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:46,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 528 transitions, 10842 flow. Second operand has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 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,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:49,534 INFO L124 PetriNetUnfolderBase]: 6653/12510 cut-off events. [2025-03-04 02:18:49,534 INFO L125 PetriNetUnfolderBase]: For 175049/175433 co-relation queries the response was YES. [2025-03-04 02:18:49,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81368 conditions, 12510 events. 6653/12510 cut-off events. For 175049/175433 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 102340 event pairs, 2852 based on Foata normal form. 64/12531 useless extension candidates. Maximal degree in co-relation 80643. Up to 8276 conditions per place. [2025-03-04 02:18:49,633 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 450 selfloop transitions, 238 changer transitions 46/748 dead transitions. [2025-03-04 02:18:49,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 748 transitions, 14689 flow [2025-03-04 02:18:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:18:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:18:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 373 transitions. [2025-03-04 02:18:49,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918067226890756 [2025-03-04 02:18:49,634 INFO L175 Difference]: Start difference. First operand has 318 places, 528 transitions, 10842 flow. Second operand 34 states and 373 transitions. [2025-03-04 02:18:49,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 748 transitions, 14689 flow [2025-03-04 02:18:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 748 transitions, 14411 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:50,389 INFO L231 Difference]: Finished difference. Result has 359 places, 575 transitions, 12212 flow [2025-03-04 02:18:50,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10422, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=12212, PETRI_PLACES=359, PETRI_TRANSITIONS=575} [2025-03-04 02:18:50,390 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 333 predicate places. [2025-03-04 02:18:50,390 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 575 transitions, 12212 flow [2025-03-04 02:18:50,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 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,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:50,390 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:50,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-03-04 02:18:50,590 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:50,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash 137133341, now seen corresponding path program 8 times [2025-03-04 02:18:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902999128] [2025-03-04 02:18:50,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:50,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:50,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:50,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902999128] [2025-03-04 02:18:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902999128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572229343] [2025-03-04 02:18:50,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:50,882 INFO L229 MonitoredProcess]: Starting monitored process 35 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:50,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 02:18:50,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:50,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:50,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:50,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:18:50,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:51,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:18:51,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:18:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:18:51,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:51,239 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:51,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2025-03-04 02:18:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:18:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572229343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:51,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 29 [2025-03-04 02:18:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052609662] [2025-03-04 02:18:51,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:18:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:51,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:18:51,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:18:51,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:51,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 575 transitions, 12212 flow. Second operand has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 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,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:51,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:51,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:59,415 INFO L124 PetriNetUnfolderBase]: 14595/27407 cut-off events. [2025-03-04 02:18:59,416 INFO L125 PetriNetUnfolderBase]: For 476834/477778 co-relation queries the response was YES. [2025-03-04 02:18:59,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188939 conditions, 27407 events. 14595/27407 cut-off events. For 476834/477778 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 252711 event pairs, 6782 based on Foata normal form. 146/27467 useless extension candidates. Maximal degree in co-relation 187549. Up to 9274 conditions per place. [2025-03-04 02:18:59,819 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 914 selfloop transitions, 539 changer transitions 106/1573 dead transitions. [2025-03-04 02:18:59,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1573 transitions, 33515 flow [2025-03-04 02:18:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 02:18:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-03-04 02:18:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 763 transitions. [2025-03-04 02:18:59,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2025-03-04 02:18:59,820 INFO L175 Difference]: Start difference. First operand has 359 places, 575 transitions, 12212 flow. Second operand 72 states and 763 transitions. [2025-03-04 02:18:59,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 1573 transitions, 33515 flow [2025-03-04 02:19:03,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1573 transitions, 32199 flow, removed 444 selfloop flow, removed 20 redundant places. [2025-03-04 02:19:03,111 INFO L231 Difference]: Finished difference. Result has 436 places, 922 transitions, 21468 flow [2025-03-04 02:19:03,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11692, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=21468, PETRI_PLACES=436, PETRI_TRANSITIONS=922} [2025-03-04 02:19:03,112 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 410 predicate places. [2025-03-04 02:19:03,112 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 922 transitions, 21468 flow [2025-03-04 02:19:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 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:03,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:03,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:03,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-04 02:19:03,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:03,313 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:03,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2047997935, now seen corresponding path program 9 times [2025-03-04 02:19:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:03,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563808547] [2025-03-04 02:19:03,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:03,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:03,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:03,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:19:03,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:03,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:03,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563808547] [2025-03-04 02:19:03,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563808547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:03,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700722153] [2025-03-04 02:19:03,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:03,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:03,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:03,728 INFO L229 MonitoredProcess]: Starting monitored process 36 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:03,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 02:19:03,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:19:03,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:19:03,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:19:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:03,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 02:19:03,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:03,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:19:04,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:19:04,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 02:19:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:04,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:19:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700722153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:04,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:04,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9] total 35 [2025-03-04 02:19:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028240414] [2025-03-04 02:19:04,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:04,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 02:19:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:04,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 02:19:04,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:19:04,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:04,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 922 transitions, 21468 flow. Second operand has 35 states, 35 states have (on average 7.171428571428572) internal successors, (251), 35 states have internal predecessors, (251), 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,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:04,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand