/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:48:23,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:48:24,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:48:24,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:48:24,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:48:24,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:48:24,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:48:24,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:48:24,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:48:24,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:48:24,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:48:24,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:48:24,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:48:24,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:48:24,083 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:48:24,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:48:24,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:24,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:24,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:24,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:48:24,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:48:24,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:48:24,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:48:24,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:48:24,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:48:24,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:48:24,320 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:48:24,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 23:48:25,595 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68db2d07/741ecc53039f4a50a1750a84c6f39410/FLAGfc6fb2d11 [2025-04-13 23:48:25,606 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-13 23:48:25,816 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:48:25,816 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 23:48:25,826 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68db2d07/741ecc53039f4a50a1750a84c6f39410/FLAGfc6fb2d11 [2025-04-13 23:48:27,696 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68db2d07/741ecc53039f4a50a1750a84c6f39410 [2025-04-13 23:48:27,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:48:27,699 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:48:27,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:27,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:48:27,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:48:27,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:27" (1/1) ... [2025-04-13 23:48:27,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1abaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:27, skipping insertion in model container [2025-04-13 23:48:27,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:27" (1/1) ... [2025-04-13 23:48:27,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:48:28,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2025-04-13 23:48:28,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:28,045 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:48:28,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2025-04-13 23:48:28,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:28,137 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:48:28,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28 WrapperNode [2025-04-13 23:48:28,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:28,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:28,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:48:28,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:48:28,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,163 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 23:48:28,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:28,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:48:28,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:48:28,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:48:28,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:48:28,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:48:28,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:48:28,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:48:28,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:48:28,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (1/1) ... [2025-04-13 23:48:28,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:28,214 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-04-13 23:48:28,216 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-04-13 23:48:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:48:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:48:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:48:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:48:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:48:28,234 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:48:28,307 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:48:28,308 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:48:28,393 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:48:28,393 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:48:28,393 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:48:28,460 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:28,467 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:28,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:48:28,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:28 BoogieIcfgContainer [2025-04-13 23:48:28,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:48:28,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:48:28,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:48:28,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:48:28,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:48:27" (1/3) ... [2025-04-13 23:48:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f15bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:28, skipping insertion in model container [2025-04-13 23:48:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:28" (2/3) ... [2025-04-13 23:48:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f15bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:28, skipping insertion in model container [2025-04-13 23:48:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:28" (3/3) ... [2025-04-13 23:48:28,478 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-04-13 23:48:28,487 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:48:28,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:48:28,488 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:48:28,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:48:28,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:28,556 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 23:48:28,559 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:28,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-13 23:48:28,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:28,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 44 flow [2025-04-13 23:48:28,575 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:48:28,586 INFO L340 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;@131e3beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:48:28,586 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:48:28,593 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:48:28,593 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 23:48:28,593 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:28,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:28,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:28,594 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:28,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -272227646, now seen corresponding path program 1 times [2025-04-13 23:48:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:28,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414689847] [2025-04-13 23:48:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:28,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:48:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:48:28,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:28,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:28,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414689847] [2025-04-13 23:48:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414689847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:28,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:48:28,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427127029] [2025-04-13 23:48:28,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:29,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:48:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:29,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:48:29,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:48:29,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:29,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:29,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:29,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:29,237 INFO L116 PetriNetUnfolderBase]: 260/405 cut-off events. [2025-04-13 23:48:29,238 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:48:29,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 405 events. 260/405 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1301 event pairs, 53 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 816. Up to 305 conditions per place. [2025-04-13 23:48:29,244 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 26 selfloop transitions, 7 changer transitions 22/55 dead transitions. [2025-04-13 23:48:29,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 55 transitions, 229 flow [2025-04-13 23:48:29,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:48:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:48:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2025-04-13 23:48:29,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2025-04-13 23:48:29,255 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 44 flow. Second operand 8 states and 85 transitions. [2025-04-13 23:48:29,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 55 transitions, 229 flow [2025-04-13 23:48:29,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:29,260 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 91 flow [2025-04-13 23:48:29,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-04-13 23:48:29,264 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2025-04-13 23:48:29,264 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 91 flow [2025-04-13 23:48:29,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:29,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:29,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:48:29,265 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:29,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1795577462, now seen corresponding path program 1 times [2025-04-13 23:48:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:29,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145313928] [2025-04-13 23:48:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:29,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:29,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:29,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:29,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145313928] [2025-04-13 23:48:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145313928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:29,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:29,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511964762] [2025-04-13 23:48:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:29,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:29,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:29,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:29,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:29,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:29,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:29,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:29,551 INFO L116 PetriNetUnfolderBase]: 196/318 cut-off events. [2025-04-13 23:48:29,551 INFO L117 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-04-13 23:48:29,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 318 events. 196/318 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 979 event pairs, 41 based on Foata normal form. 15/280 useless extension candidates. Maximal degree in co-relation 899. Up to 187 conditions per place. [2025-04-13 23:48:29,553 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 8 changer transitions 12/47 dead transitions. [2025-04-13 23:48:29,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 273 flow [2025-04-13 23:48:29,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:48:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:48:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-13 23:48:29,554 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2025-04-13 23:48:29,554 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 91 flow. Second operand 6 states and 55 transitions. [2025-04-13 23:48:29,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 273 flow [2025-04-13 23:48:29,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 269 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:29,557 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 135 flow [2025-04-13 23:48:29,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2025-04-13 23:48:29,557 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2025-04-13 23:48:29,557 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 135 flow [2025-04-13 23:48:29,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:29,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:29,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:48:29,558 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:29,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash 396254466, now seen corresponding path program 1 times [2025-04-13 23:48:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:29,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170420389] [2025-04-13 23:48:29,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:29,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:29,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:29,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:29,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170420389] [2025-04-13 23:48:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170420389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016523846] [2025-04-13 23:48:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:29,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:29,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:29,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:29,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:29,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:29,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:29,811 INFO L116 PetriNetUnfolderBase]: 301/492 cut-off events. [2025-04-13 23:48:29,812 INFO L117 PetriNetUnfolderBase]: For 879/879 co-relation queries the response was YES. [2025-04-13 23:48:29,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 492 events. 301/492 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1678 event pairs, 65 based on Foata normal form. 24/428 useless extension candidates. Maximal degree in co-relation 1610. Up to 231 conditions per place. [2025-04-13 23:48:29,815 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 11 changer transitions 19/74 dead transitions. [2025-04-13 23:48:29,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 74 transitions, 493 flow [2025-04-13 23:48:29,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 23:48:29,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-13 23:48:29,816 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 135 flow. Second operand 9 states and 86 transitions. [2025-04-13 23:48:29,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 74 transitions, 493 flow [2025-04-13 23:48:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 451 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-04-13 23:48:29,819 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 231 flow [2025-04-13 23:48:29,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=231, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-04-13 23:48:29,820 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2025-04-13 23:48:29,820 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 231 flow [2025-04-13 23:48:29,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:29,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:29,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:48:29,820 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:29,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 396744576, now seen corresponding path program 2 times [2025-04-13 23:48:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:29,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061069174] [2025-04-13 23:48:29,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:29,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:29,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:29,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:29,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061069174] [2025-04-13 23:48:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061069174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137307604] [2025-04-13 23:48:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:29,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:29,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:29,917 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:29,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:29,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:29,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:29,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:30,066 INFO L116 PetriNetUnfolderBase]: 256/429 cut-off events. [2025-04-13 23:48:30,066 INFO L117 PetriNetUnfolderBase]: For 1458/1458 co-relation queries the response was YES. [2025-04-13 23:48:30,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 429 events. 256/429 cut-off events. For 1458/1458 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1475 event pairs, 65 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1593. Up to 208 conditions per place. [2025-04-13 23:48:30,069 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 11 changer transitions 25/74 dead transitions. [2025-04-13 23:48:30,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 591 flow [2025-04-13 23:48:30,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:48:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:48:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-04-13 23:48:30,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-13 23:48:30,070 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 231 flow. Second operand 8 states and 76 transitions. [2025-04-13 23:48:30,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 591 flow [2025-04-13 23:48:30,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 547 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:30,074 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 262 flow [2025-04-13 23:48:30,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-04-13 23:48:30,075 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 31 predicate places. [2025-04-13 23:48:30,075 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 262 flow [2025-04-13 23:48:30,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:30,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:30,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:48:30,075 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:30,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1124046116, now seen corresponding path program 1 times [2025-04-13 23:48:30,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:30,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372538445] [2025-04-13 23:48:30,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:30,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:30,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:30,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:30,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:30,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372538445] [2025-04-13 23:48:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372538445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628984808] [2025-04-13 23:48:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:30,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:30,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:30,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:30,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:30,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:30,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:30,338 INFO L116 PetriNetUnfolderBase]: 400/660 cut-off events. [2025-04-13 23:48:30,339 INFO L117 PetriNetUnfolderBase]: For 3374/3374 co-relation queries the response was YES. [2025-04-13 23:48:30,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 660 events. 400/660 cut-off events. For 3374/3374 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2479 event pairs, 43 based on Foata normal form. 27/543 useless extension candidates. Maximal degree in co-relation 2712. Up to 181 conditions per place. [2025-04-13 23:48:30,342 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 54 selfloop transitions, 20 changer transitions 21/95 dead transitions. [2025-04-13 23:48:30,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 804 flow [2025-04-13 23:48:30,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-04-13 23:48:30,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2025-04-13 23:48:30,343 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 262 flow. Second operand 11 states and 106 transitions. [2025-04-13 23:48:30,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 804 flow [2025-04-13 23:48:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 709 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-04-13 23:48:30,349 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 372 flow [2025-04-13 23:48:30,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=372, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-04-13 23:48:30,349 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 38 predicate places. [2025-04-13 23:48:30,349 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 372 flow [2025-04-13 23:48:30,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:30,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:30,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:48:30,350 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:30,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1898509928, now seen corresponding path program 2 times [2025-04-13 23:48:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:30,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044080808] [2025-04-13 23:48:30,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:30,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:30,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:30,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:30,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:30,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044080808] [2025-04-13 23:48:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044080808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930989086] [2025-04-13 23:48:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:30,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:30,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:30,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:30,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:30,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:30,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:30,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:30,635 INFO L116 PetriNetUnfolderBase]: 337/570 cut-off events. [2025-04-13 23:48:30,636 INFO L117 PetriNetUnfolderBase]: For 4310/4310 co-relation queries the response was YES. [2025-04-13 23:48:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 570 events. 337/570 cut-off events. For 4310/4310 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2128 event pairs, 43 based on Foata normal form. 45/489 useless extension candidates. Maximal degree in co-relation 2564. Up to 151 conditions per place. [2025-04-13 23:48:30,639 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 41 selfloop transitions, 20 changer transitions 29/90 dead transitions. [2025-04-13 23:48:30,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 888 flow [2025-04-13 23:48:30,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:48:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 23:48:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2025-04-13 23:48:30,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-04-13 23:48:30,640 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 372 flow. Second operand 10 states and 93 transitions. [2025-04-13 23:48:30,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 888 flow [2025-04-13 23:48:30,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 779 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-04-13 23:48:30,665 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 392 flow [2025-04-13 23:48:30,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-04-13 23:48:30,666 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 43 predicate places. [2025-04-13 23:48:30,666 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 392 flow [2025-04-13 23:48:30,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:30,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:30,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:48:30,666 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:30,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1129004876, now seen corresponding path program 3 times [2025-04-13 23:48:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:30,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124725762] [2025-04-13 23:48:30,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:30,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:30,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:30,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:48:30,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:30,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124725762] [2025-04-13 23:48:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124725762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555082856] [2025-04-13 23:48:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:30,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:30,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:30,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:30,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:30,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:30,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:30,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:30,893 INFO L116 PetriNetUnfolderBase]: 361/609 cut-off events. [2025-04-13 23:48:30,893 INFO L117 PetriNetUnfolderBase]: For 4297/4297 co-relation queries the response was YES. [2025-04-13 23:48:30,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 609 events. 361/609 cut-off events. For 4297/4297 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2434 event pairs, 105 based on Foata normal form. 18/493 useless extension candidates. Maximal degree in co-relation 2712. Up to 351 conditions per place. [2025-04-13 23:48:30,898 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 50 selfloop transitions, 16 changer transitions 17/83 dead transitions. [2025-04-13 23:48:30,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 848 flow [2025-04-13 23:48:30,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-04-13 23:48:30,899 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2025-04-13 23:48:30,899 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 392 flow. Second operand 9 states and 82 transitions. [2025-04-13 23:48:30,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 848 flow [2025-04-13 23:48:30,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 762 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-04-13 23:48:30,906 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 455 flow [2025-04-13 23:48:30,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=455, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-04-13 23:48:30,908 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2025-04-13 23:48:30,908 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 455 flow [2025-04-13 23:48:30,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:30,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:30,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:30,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:48:30,909 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:30,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1750756597, now seen corresponding path program 1 times [2025-04-13 23:48:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:30,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079333414] [2025-04-13 23:48:30,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:30,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:30,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:30,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:30,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:31,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079333414] [2025-04-13 23:48:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079333414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:31,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749241421] [2025-04-13 23:48:31,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:31,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:31,013 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-04-13 23:48:31,014 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-04-13 23:48:31,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:31,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:31,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:31,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:31,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:48:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:31,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749241421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:31,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:48:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717482489] [2025-04-13 23:48:31,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:31,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:31,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:31,239 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:31,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 455 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:31,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:31,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:31,608 INFO L116 PetriNetUnfolderBase]: 595/978 cut-off events. [2025-04-13 23:48:31,608 INFO L117 PetriNetUnfolderBase]: For 8580/8580 co-relation queries the response was YES. [2025-04-13 23:48:31,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 978 events. 595/978 cut-off events. For 8580/8580 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3768 event pairs, 37 based on Foata normal form. 45/799 useless extension candidates. Maximal degree in co-relation 4584. Up to 201 conditions per place. [2025-04-13 23:48:31,613 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 66 selfloop transitions, 37 changer transitions 54/157 dead transitions. [2025-04-13 23:48:31,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 157 transitions, 1577 flow [2025-04-13 23:48:31,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:48:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 23:48:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 177 transitions. [2025-04-13 23:48:31,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44360902255639095 [2025-04-13 23:48:31,614 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 455 flow. Second operand 19 states and 177 transitions. [2025-04-13 23:48:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 157 transitions, 1577 flow [2025-04-13 23:48:31,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 157 transitions, 1512 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:31,624 INFO L231 Difference]: Finished difference. Result has 88 places, 61 transitions, 822 flow [2025-04-13 23:48:31,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=822, PETRI_PLACES=88, PETRI_TRANSITIONS=61} [2025-04-13 23:48:31,625 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 66 predicate places. [2025-04-13 23:48:31,625 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 61 transitions, 822 flow [2025-04-13 23:48:31,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:31,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:31,625 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:31,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:48:31,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:31,828 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:31,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1445863824, now seen corresponding path program 1 times [2025-04-13 23:48:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:31,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050468294] [2025-04-13 23:48:31,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:31,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:48:31,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:31,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:31,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:31,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050468294] [2025-04-13 23:48:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050468294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:31,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597821886] [2025-04-13 23:48:31,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:31,961 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-04-13 23:48:31,963 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-04-13 23:48:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:48:32,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:32,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:32,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:32,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:48:32,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:32,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597821886] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:32,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-13 23:48:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219174881] [2025-04-13 23:48:32,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:32,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 23:48:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:32,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 23:48:32,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:48:32,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 61 transitions, 822 flow. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:32,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:32,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:32,736 INFO L116 PetriNetUnfolderBase]: 793/1338 cut-off events. [2025-04-13 23:48:32,736 INFO L117 PetriNetUnfolderBase]: For 21791/21791 co-relation queries the response was YES. [2025-04-13 23:48:32,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 1338 events. 793/1338 cut-off events. For 21791/21791 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5215 event pairs, 191 based on Foata normal form. 81/1087 useless extension candidates. Maximal degree in co-relation 7361. Up to 723 conditions per place. [2025-04-13 23:48:32,745 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 95 selfloop transitions, 27 changer transitions 86/208 dead transitions. [2025-04-13 23:48:32,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 208 transitions, 2598 flow [2025-04-13 23:48:32,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:48:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 23:48:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 223 transitions. [2025-04-13 23:48:32,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4247619047619048 [2025-04-13 23:48:32,747 INFO L175 Difference]: Start difference. First operand has 88 places, 61 transitions, 822 flow. Second operand 25 states and 223 transitions. [2025-04-13 23:48:32,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 208 transitions, 2598 flow [2025-04-13 23:48:32,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 208 transitions, 2071 flow, removed 250 selfloop flow, removed 10 redundant places. [2025-04-13 23:48:32,773 INFO L231 Difference]: Finished difference. Result has 116 places, 75 transitions, 926 flow [2025-04-13 23:48:32,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=926, PETRI_PLACES=116, PETRI_TRANSITIONS=75} [2025-04-13 23:48:32,773 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 94 predicate places. [2025-04-13 23:48:32,774 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 75 transitions, 926 flow [2025-04-13 23:48:32,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:32,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:32,774 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:32,780 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-04-13 23:48:32,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 23:48:32,978 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:32,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2007666668, now seen corresponding path program 2 times [2025-04-13 23:48:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:32,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174656849] [2025-04-13 23:48:32,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:32,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:48:32,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:32,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:32,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:33,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174656849] [2025-04-13 23:48:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174656849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:33,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904582627] [2025-04-13 23:48:33,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:33,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:33,095 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-04-13 23:48:33,097 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-04-13 23:48:33,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:48:33,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:33,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:33,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:33,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:48:33,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:33,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904582627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:33,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-13 23:48:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395628430] [2025-04-13 23:48:33,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:33,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 23:48:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:33,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 23:48:33,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:48:33,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:33,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 75 transitions, 926 flow. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:33,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:33,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:33,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:34,067 INFO L116 PetriNetUnfolderBase]: 1387/2364 cut-off events. [2025-04-13 23:48:34,068 INFO L117 PetriNetUnfolderBase]: For 70227/70227 co-relation queries the response was YES. [2025-04-13 23:48:34,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14670 conditions, 2364 events. 1387/2364 cut-off events. For 70227/70227 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11228 event pairs, 115 based on Foata normal form. 81/1825 useless extension candidates. Maximal degree in co-relation 14612. Up to 497 conditions per place. [2025-04-13 23:48:34,083 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 127 selfloop transitions, 82 changer transitions 85/294 dead transitions. [2025-04-13 23:48:34,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 294 transitions, 4090 flow [2025-04-13 23:48:34,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 23:48:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 23:48:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 291 transitions. [2025-04-13 23:48:34,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2025-04-13 23:48:34,085 INFO L175 Difference]: Start difference. First operand has 116 places, 75 transitions, 926 flow. Second operand 32 states and 291 transitions. [2025-04-13 23:48:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 294 transitions, 4090 flow [2025-04-13 23:48:34,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 294 transitions, 3473 flow, removed 299 selfloop flow, removed 13 redundant places. [2025-04-13 23:48:34,136 INFO L231 Difference]: Finished difference. Result has 148 places, 118 transitions, 1759 flow [2025-04-13 23:48:34,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1759, PETRI_PLACES=148, PETRI_TRANSITIONS=118} [2025-04-13 23:48:34,137 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 126 predicate places. [2025-04-13 23:48:34,137 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 118 transitions, 1759 flow [2025-04-13 23:48:34,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:34,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:34,137 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:34,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:48:34,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:34,338 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:34,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2070728130, now seen corresponding path program 3 times [2025-04-13 23:48:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:34,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9335096] [2025-04-13 23:48:34,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:34,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 23:48:34,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:34,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:34,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9335096] [2025-04-13 23:48:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9335096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:34,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662262031] [2025-04-13 23:48:34,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:34,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:34,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:34,446 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-04-13 23:48:34,448 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-04-13 23:48:34,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 23:48:34,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:48:34,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:34,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:48:34,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:34,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662262031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:34,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 23:48:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409636953] [2025-04-13 23:48:34,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:34,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:48:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:34,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:48:34,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:48:34,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:34,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 118 transitions, 1759 flow. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:34,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:34,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:34,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:35,502 INFO L116 PetriNetUnfolderBase]: 1774/3012 cut-off events. [2025-04-13 23:48:35,503 INFO L117 PetriNetUnfolderBase]: For 157711/157711 co-relation queries the response was YES. [2025-04-13 23:48:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 3012 events. 1774/3012 cut-off events. For 157711/157711 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15080 event pairs, 29 based on Foata normal form. 117/2335 useless extension candidates. Maximal degree in co-relation 21768. Up to 653 conditions per place. [2025-04-13 23:48:35,526 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 124 selfloop transitions, 123 changer transitions 109/356 dead transitions. [2025-04-13 23:48:35,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 356 transitions, 6116 flow [2025-04-13 23:48:35,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:48:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 23:48:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 329 transitions. [2025-04-13 23:48:35,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2025-04-13 23:48:35,528 INFO L175 Difference]: Start difference. First operand has 148 places, 118 transitions, 1759 flow. Second operand 36 states and 329 transitions. [2025-04-13 23:48:35,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 356 transitions, 6116 flow [2025-04-13 23:48:35,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 356 transitions, 5206 flow, removed 440 selfloop flow, removed 15 redundant places. [2025-04-13 23:48:35,737 INFO L231 Difference]: Finished difference. Result has 182 places, 153 transitions, 2619 flow [2025-04-13 23:48:35,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2619, PETRI_PLACES=182, PETRI_TRANSITIONS=153} [2025-04-13 23:48:35,738 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 160 predicate places. [2025-04-13 23:48:35,738 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 153 transitions, 2619 flow [2025-04-13 23:48:35,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:35,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:35,738 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:35,744 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-04-13 23:48:35,939 WARN L466 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-04-13 23:48:35,939 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:35,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash 218655973, now seen corresponding path program 4 times [2025-04-13 23:48:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:35,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933856165] [2025-04-13 23:48:35,940 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:35,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:48:35,946 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:48:35,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:36,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933856165] [2025-04-13 23:48:36,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933856165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:36,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520738441] [2025-04-13 23:48:36,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:36,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:36,093 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-04-13 23:48:36,095 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-04-13 23:48:36,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:48:36,136 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:48:36,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:36,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:36,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 23:48:36,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:36,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520738441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:36,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-04-13 23:48:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748414198] [2025-04-13 23:48:36,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:36,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:48:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:36,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:48:36,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:48:36,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:36,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 153 transitions, 2619 flow. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:36,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:36,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:36,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:37,700 INFO L116 PetriNetUnfolderBase]: 2584/4326 cut-off events. [2025-04-13 23:48:37,701 INFO L117 PetriNetUnfolderBase]: For 342158/342158 co-relation queries the response was YES. [2025-04-13 23:48:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37410 conditions, 4326 events. 2584/4326 cut-off events. For 342158/342158 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 20686 event pairs, 67 based on Foata normal form. 99/3295 useless extension candidates. Maximal degree in co-relation 37324. Up to 971 conditions per place. [2025-04-13 23:48:37,734 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 164 selfloop transitions, 178 changer transitions 144/486 dead transitions. [2025-04-13 23:48:37,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 486 transitions, 10298 flow [2025-04-13 23:48:37,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 23:48:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-13 23:48:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 453 transitions. [2025-04-13 23:48:37,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4402332361516035 [2025-04-13 23:48:37,736 INFO L175 Difference]: Start difference. First operand has 182 places, 153 transitions, 2619 flow. Second operand 49 states and 453 transitions. [2025-04-13 23:48:37,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 486 transitions, 10298 flow [2025-04-13 23:48:38,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 486 transitions, 8582 flow, removed 825 selfloop flow, removed 20 redundant places. [2025-04-13 23:48:38,099 INFO L231 Difference]: Finished difference. Result has 232 places, 214 transitions, 4201 flow [2025-04-13 23:48:38,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=4201, PETRI_PLACES=232, PETRI_TRANSITIONS=214} [2025-04-13 23:48:38,100 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 210 predicate places. [2025-04-13 23:48:38,100 INFO L485 AbstractCegarLoop]: Abstraction has has 232 places, 214 transitions, 4201 flow [2025-04-13 23:48:38,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:38,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:38,100 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:38,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:48:38,300 WARN L466 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-04-13 23:48:38,301 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:38,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1880197436, now seen corresponding path program 5 times [2025-04-13 23:48:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:38,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898210567] [2025-04-13 23:48:38,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:48:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:38,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 16 equivalence classes. [2025-04-13 23:48:38,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:38,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-04-13 23:48:38,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:38,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898210567] [2025-04-13 23:48:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898210567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:38,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088233218] [2025-04-13 23:48:38,584 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:48:38,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:38,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:38,586 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-04-13 23:48:38,587 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-04-13 23:48:38,620 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 16 equivalence classes. [2025-04-13 23:48:38,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:38,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-04-13 23:48:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:38,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:48:38,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:38,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088233218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:39,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 23:48:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398416309] [2025-04-13 23:48:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:39,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:48:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:48:39,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:48:39,126 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:39,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 214 transitions, 4201 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:39,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:39,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:39,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:40,302 INFO L116 PetriNetUnfolderBase]: 2656/4506 cut-off events. [2025-04-13 23:48:40,302 INFO L117 PetriNetUnfolderBase]: For 529961/529961 co-relation queries the response was YES. [2025-04-13 23:48:40,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43014 conditions, 4506 events. 2656/4506 cut-off events. For 529961/529961 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22308 event pairs, 989 based on Foata normal form. 63/3367 useless extension candidates. Maximal degree in co-relation 42906. Up to 3585 conditions per place. [2025-04-13 23:48:40,335 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 261 selfloop transitions, 47 changer transitions 92/400 dead transitions. [2025-04-13 23:48:40,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 400 transitions, 9659 flow [2025-04-13 23:48:40,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:48:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 23:48:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 283 transitions. [2025-04-13 23:48:40,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4083694083694084 [2025-04-13 23:48:40,337 INFO L175 Difference]: Start difference. First operand has 232 places, 214 transitions, 4201 flow. Second operand 33 states and 283 transitions. [2025-04-13 23:48:40,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 400 transitions, 9659 flow [2025-04-13 23:48:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 400 transitions, 7159 flow, removed 1227 selfloop flow, removed 17 redundant places. [2025-04-13 23:48:41,011 INFO L231 Difference]: Finished difference. Result has 251 places, 230 transitions, 3746 flow [2025-04-13 23:48:41,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3087, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3746, PETRI_PLACES=251, PETRI_TRANSITIONS=230} [2025-04-13 23:48:41,011 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 229 predicate places. [2025-04-13 23:48:41,011 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 230 transitions, 3746 flow [2025-04-13 23:48:41,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:41,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:41,012 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:41,018 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-04-13 23:48:41,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:41,212 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:41,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1567848776, now seen corresponding path program 6 times [2025-04-13 23:48:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:41,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130654211] [2025-04-13 23:48:41,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:48:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:41,222 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 15 equivalence classes. [2025-04-13 23:48:41,229 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:41,229 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-04-13 23:48:41,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:41,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130654211] [2025-04-13 23:48:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130654211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:41,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109197251] [2025-04-13 23:48:41,496 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:48:41,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:41,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:41,497 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-04-13 23:48:41,499 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-04-13 23:48:41,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 15 equivalence classes. [2025-04-13 23:48:41,545 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:41,545 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-04-13 23:48:41,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:41,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:48:41,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:41,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109197251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:41,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:41,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 23:48:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298943609] [2025-04-13 23:48:41,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:41,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:48:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:41,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:48:41,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:48:41,944 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:41,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 230 transitions, 3746 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:41,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:41,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:41,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:43,674 INFO L116 PetriNetUnfolderBase]: 3160/5514 cut-off events. [2025-04-13 23:48:43,675 INFO L117 PetriNetUnfolderBase]: For 509798/509798 co-relation queries the response was YES. [2025-04-13 23:48:43,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46895 conditions, 5514 events. 3160/5514 cut-off events. For 509798/509798 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 28959 event pairs, 575 based on Foata normal form. 63/4039 useless extension candidates. Maximal degree in co-relation 46782. Up to 2398 conditions per place. [2025-04-13 23:48:43,711 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 265 selfloop transitions, 167 changer transitions 129/561 dead transitions. [2025-04-13 23:48:43,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 561 transitions, 10833 flow [2025-04-13 23:48:43,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:48:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-04-13 23:48:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 449 transitions. [2025-04-13 23:48:43,713 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40341419586702604 [2025-04-13 23:48:43,713 INFO L175 Difference]: Start difference. First operand has 251 places, 230 transitions, 3746 flow. Second operand 53 states and 449 transitions. [2025-04-13 23:48:43,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 561 transitions, 10833 flow [2025-04-13 23:48:44,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 561 transitions, 10070 flow, removed 354 selfloop flow, removed 21 redundant places. [2025-04-13 23:48:44,532 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 5028 flow [2025-04-13 23:48:44,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3325, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=5028, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-04-13 23:48:44,533 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 272 predicate places. [2025-04-13 23:48:44,533 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 5028 flow [2025-04-13 23:48:44,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:44,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:44,533 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:44,539 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-04-13 23:48:44,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:44,734 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:44,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1750751086, now seen corresponding path program 7 times [2025-04-13 23:48:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:44,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405564688] [2025-04-13 23:48:44,735 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:48:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:44,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 23:48:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:45,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405564688] [2025-04-13 23:48:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405564688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:45,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627856049] [2025-04-13 23:48:45,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:48:45,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:45,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:45,003 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-04-13 23:48:45,004 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-04-13 23:48:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 23:48:45,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:45,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:45,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:45,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:48:45,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 1 proven. 113 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:45,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627856049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:45,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2025-04-13 23:48:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728775706] [2025-04-13 23:48:45,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:45,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:48:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:45,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:48:45,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:48:45,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:45,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 5028 flow. Second operand has 42 states, 42 states have (on average 4.142857142857143) internal successors, (174), 42 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:45,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:45,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:45,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:47,768 INFO L116 PetriNetUnfolderBase]: 4051/7278 cut-off events. [2025-04-13 23:48:47,769 INFO L117 PetriNetUnfolderBase]: For 871455/871455 co-relation queries the response was YES. [2025-04-13 23:48:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68864 conditions, 7278 events. 4051/7278 cut-off events. For 871455/871455 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 41856 event pairs, 259 based on Foata normal form. 81/5239 useless extension candidates. Maximal degree in co-relation 68738. Up to 1943 conditions per place. [2025-04-13 23:48:47,828 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 239 selfloop transitions, 311 changer transitions 151/701 dead transitions. [2025-04-13 23:48:47,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 701 transitions, 15166 flow [2025-04-13 23:48:47,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:48:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 23:48:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 511 transitions. [2025-04-13 23:48:47,831 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4124293785310734 [2025-04-13 23:48:47,831 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 5028 flow. Second operand 59 states and 511 transitions. [2025-04-13 23:48:47,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 701 transitions, 15166 flow [2025-04-13 23:48:50,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 701 transitions, 13685 flow, removed 640 selfloop flow, removed 29 redundant places. [2025-04-13 23:48:50,028 INFO L231 Difference]: Finished difference. Result has 339 places, 383 transitions, 7431 flow [2025-04-13 23:48:50,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4263, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7431, PETRI_PLACES=339, PETRI_TRANSITIONS=383} [2025-04-13 23:48:50,029 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 317 predicate places. [2025-04-13 23:48:50,029 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 383 transitions, 7431 flow [2025-04-13 23:48:50,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.142857142857143) internal successors, (174), 42 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:50,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:50,030 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:50,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:48:50,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:48:50,230 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:50,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1647698938, now seen corresponding path program 8 times [2025-04-13 23:48:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:50,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828410482] [2025-04-13 23:48:50,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:50,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:48:50,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:50,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:50,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:50,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828410482] [2025-04-13 23:48:50,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828410482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:50,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572120474] [2025-04-13 23:48:50,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:50,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:50,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:50,495 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-04-13 23:48:50,498 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-04-13 23:48:50,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:48:50,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:50,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:50,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:50,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:48:50,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:50,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572120474] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:50,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 23:48:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089545062] [2025-04-13 23:48:50,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:50,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:48:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:50,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:48:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:48:50,933 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:50,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 383 transitions, 7431 flow. Second operand has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:50,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:50,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:50,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:53,698 INFO L116 PetriNetUnfolderBase]: 5095/9150 cut-off events. [2025-04-13 23:48:53,698 INFO L117 PetriNetUnfolderBase]: For 1495861/1495861 co-relation queries the response was YES. [2025-04-13 23:48:53,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96101 conditions, 9150 events. 5095/9150 cut-off events. For 1495861/1495861 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 55510 event pairs, 121 based on Foata normal form. 81/6559 useless extension candidates. Maximal degree in co-relation 95958. Up to 2495 conditions per place. [2025-04-13 23:48:53,773 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 222 selfloop transitions, 424 changer transitions 151/797 dead transitions. [2025-04-13 23:48:53,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 797 transitions, 18568 flow [2025-04-13 23:48:53,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:48:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 23:48:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 521 transitions. [2025-04-13 23:48:53,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.420500403551251 [2025-04-13 23:48:53,775 INFO L175 Difference]: Start difference. First operand has 339 places, 383 transitions, 7431 flow. Second operand 59 states and 521 transitions. [2025-04-13 23:48:53,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 797 transitions, 18568 flow [2025-04-13 23:48:56,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 797 transitions, 15905 flow, removed 1181 selfloop flow, removed 31 redundant places. [2025-04-13 23:48:56,960 INFO L231 Difference]: Finished difference. Result has 383 places, 479 transitions, 9479 flow [2025-04-13 23:48:56,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5972, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9479, PETRI_PLACES=383, PETRI_TRANSITIONS=479} [2025-04-13 23:48:56,961 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 361 predicate places. [2025-04-13 23:48:56,961 INFO L485 AbstractCegarLoop]: Abstraction has has 383 places, 479 transitions, 9479 flow [2025-04-13 23:48:56,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:56,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:56,961 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:56,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:48:57,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:48:57,162 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:57,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash -229875748, now seen corresponding path program 9 times [2025-04-13 23:48:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:57,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055266992] [2025-04-13 23:48:57,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:57,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 16 equivalence classes. [2025-04-13 23:48:57,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:57,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-13 23:48:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:57,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055266992] [2025-04-13 23:48:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055266992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:57,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221709518] [2025-04-13 23:48:57,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:57,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:57,397 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-04-13 23:48:57,398 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-04-13 23:48:57,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 16 equivalence classes. [2025-04-13 23:48:57,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:48:57,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-13 23:48:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:57,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:48:57,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 1 proven. 191 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:57,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221709518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:57,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2025-04-13 23:48:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388334087] [2025-04-13 23:48:57,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:57,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:48:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:48:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:48:57,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:57,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 479 transitions, 9479 flow. Second operand has 42 states, 42 states have (on average 4.166666666666667) internal successors, (175), 42 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:57,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:57,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:57,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:00,810 INFO L116 PetriNetUnfolderBase]: 5869/10455 cut-off events. [2025-04-13 23:49:00,811 INFO L117 PetriNetUnfolderBase]: For 1963715/1963715 co-relation queries the response was YES. [2025-04-13 23:49:00,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115698 conditions, 10455 events. 5869/10455 cut-off events. For 1963715/1963715 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 64567 event pairs, 37 based on Foata normal form. 90/7519 useless extension candidates. Maximal degree in co-relation 115537. Up to 2807 conditions per place. [2025-04-13 23:49:00,921 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 215 selfloop transitions, 497 changer transitions 156/868 dead transitions. [2025-04-13 23:49:00,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 868 transitions, 21158 flow [2025-04-13 23:49:00,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:49:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 23:49:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2025-04-13 23:49:00,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42936507936507934 [2025-04-13 23:49:00,922 INFO L175 Difference]: Start difference. First operand has 383 places, 479 transitions, 9479 flow. Second operand 60 states and 541 transitions. [2025-04-13 23:49:00,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 868 transitions, 21158 flow [2025-04-13 23:49:05,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 868 transitions, 18602 flow, removed 1090 selfloop flow, removed 34 redundant places. [2025-04-13 23:49:05,883 INFO L231 Difference]: Finished difference. Result has 423 places, 539 transitions, 11164 flow [2025-04-13 23:49:05,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7837, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=11164, PETRI_PLACES=423, PETRI_TRANSITIONS=539} [2025-04-13 23:49:05,884 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 401 predicate places. [2025-04-13 23:49:05,884 INFO L485 AbstractCegarLoop]: Abstraction has has 423 places, 539 transitions, 11164 flow [2025-04-13 23:49:05,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.166666666666667) internal successors, (175), 42 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:05,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:05,884 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:05,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:49:06,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:49:06,085 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:06,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash 892575027, now seen corresponding path program 10 times [2025-04-13 23:49:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:06,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764237723] [2025-04-13 23:49:06,086 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:49:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:06,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 23:49:06,096 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:06,096 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:49:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:06,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764237723] [2025-04-13 23:49:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764237723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:06,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344658544] [2025-04-13 23:49:06,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:49:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:06,316 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-04-13 23:49:06,318 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-04-13 23:49:06,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 23:49:06,370 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:06,370 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:49:06,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:06,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:49:06,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:06,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344658544] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:06,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2025-04-13 23:49:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516798572] [2025-04-13 23:49:06,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:06,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 23:49:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:06,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 23:49:06,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:49:06,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:49:06,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 539 transitions, 11164 flow. Second operand has 43 states, 43 states have (on average 4.116279069767442) internal successors, (177), 43 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:06,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:06,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:49:06,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:09,676 INFO L116 PetriNetUnfolderBase]: 6004/10734 cut-off events. [2025-04-13 23:49:09,677 INFO L117 PetriNetUnfolderBase]: For 2480143/2480143 co-relation queries the response was YES. [2025-04-13 23:49:09,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126079 conditions, 10734 events. 6004/10734 cut-off events. For 2480143/2480143 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 66731 event pairs, 181 based on Foata normal form. 27/7639 useless extension candidates. Maximal degree in co-relation 125903. Up to 2861 conditions per place. [2025-04-13 23:49:09,811 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 226 selfloop transitions, 481 changer transitions 85/792 dead transitions. [2025-04-13 23:49:09,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 792 transitions, 19503 flow [2025-04-13 23:49:09,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:49:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 23:49:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 393 transitions. [2025-04-13 23:49:09,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2025-04-13 23:49:09,812 INFO L175 Difference]: Start difference. First operand has 423 places, 539 transitions, 11164 flow. Second operand 43 states and 393 transitions. [2025-04-13 23:49:09,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 792 transitions, 19503 flow [2025-04-13 23:49:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 792 transitions, 16034 flow, removed 1429 selfloop flow, removed 42 redundant places. [2025-04-13 23:49:18,322 INFO L231 Difference]: Finished difference. Result has 420 places, 557 transitions, 10953 flow [2025-04-13 23:49:18,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=9117, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10953, PETRI_PLACES=420, PETRI_TRANSITIONS=557} [2025-04-13 23:49:18,323 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 398 predicate places. [2025-04-13 23:49:18,323 INFO L485 AbstractCegarLoop]: Abstraction has has 420 places, 557 transitions, 10953 flow [2025-04-13 23:49:18,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.116279069767442) internal successors, (177), 43 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:18,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:18,323 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:18,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 23:49:18,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 23:49:18,523 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:18,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -486028041, now seen corresponding path program 11 times [2025-04-13 23:49:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:18,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829436353] [2025-04-13 23:49:18,524 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:49:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:18,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 17 equivalence classes. [2025-04-13 23:49:18,535 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:18,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-04-13 23:49:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:18,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829436353] [2025-04-13 23:49:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829436353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:18,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993359675] [2025-04-13 23:49:18,731 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:49:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:18,733 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-04-13 23:49:18,734 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-04-13 23:49:18,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 17 equivalence classes. [2025-04-13 23:49:18,774 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:18,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-04-13 23:49:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:18,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:49:18,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:18,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:49:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993359675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:19,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2025-04-13 23:49:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103672599] [2025-04-13 23:49:19,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:19,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 23:49:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 23:49:19,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 23:49:19,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:49:19,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 557 transitions, 10953 flow. Second operand has 44 states, 44 states have (on average 4.113636363636363) internal successors, (181), 44 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:19,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:19,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:49:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:21,981 INFO L116 PetriNetUnfolderBase]: 5977/10698 cut-off events. [2025-04-13 23:49:21,981 INFO L117 PetriNetUnfolderBase]: For 1935678/1935678 co-relation queries the response was YES. [2025-04-13 23:49:22,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113745 conditions, 10698 events. 5977/10698 cut-off events. For 1935678/1935678 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 66496 event pairs, 139 based on Foata normal form. 45/7627 useless extension candidates. Maximal degree in co-relation 113571. Up to 2813 conditions per place. [2025-04-13 23:49:22,101 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 212 selfloop transitions, 494 changer transitions 95/801 dead transitions. [2025-04-13 23:49:22,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 801 transitions, 17964 flow [2025-04-13 23:49:22,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:49:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-13 23:49:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 405 transitions. [2025-04-13 23:49:22,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 23:49:22,102 INFO L175 Difference]: Start difference. First operand has 420 places, 557 transitions, 10953 flow. Second operand 45 states and 405 transitions. [2025-04-13 23:49:22,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 801 transitions, 17964 flow [2025-04-13 23:49:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 801 transitions, 16333 flow, removed 658 selfloop flow, removed 24 redundant places. [2025-04-13 23:49:27,518 INFO L231 Difference]: Finished difference. Result has 443 places, 560 transitions, 11442 flow [2025-04-13 23:49:27,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10110, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=491, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=11442, PETRI_PLACES=443, PETRI_TRANSITIONS=560} [2025-04-13 23:49:27,519 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 421 predicate places. [2025-04-13 23:49:27,519 INFO L485 AbstractCegarLoop]: Abstraction has has 443 places, 560 transitions, 11442 flow [2025-04-13 23:49:27,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.113636363636363) internal successors, (181), 44 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:27,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:27,519 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:27,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:49:27,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:27,720 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:27,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 346940314, now seen corresponding path program 12 times [2025-04-13 23:49:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:27,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589192447] [2025-04-13 23:49:27,721 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:49:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:27,724 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 18 equivalence classes. [2025-04-13 23:49:27,736 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 23:49:27,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-04-13 23:49:27,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:27,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:27,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-13 23:49:27,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 23:49:27,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:27,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:27,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:27,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:27,770 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:49:27,771 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:49:27,771 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:49:27,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:49:27,772 INFO L422 BasicCegarLoop]: Path program histogram: [12, 3, 2, 1, 1, 1] [2025-04-13 23:49:27,839 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:49:27,839 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:49:27,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:49:27 BasicIcfg [2025-04-13 23:49:27,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:49:27,842 INFO L158 Benchmark]: Toolchain (without parser) took 60143.39ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 99.4MB in the beginning and 660.6MB in the end (delta: -561.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 23:49:27,842 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:27,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 76.6MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:49:27,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.18ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:49:27,843 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:27,843 INFO L158 Benchmark]: IcfgBuilder took 281.80ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 52.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:49:27,843 INFO L158 Benchmark]: TraceAbstraction took 59369.31ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 51.6MB in the beginning and 660.6MB in the end (delta: -609.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 23:49:27,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 76.6MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.18ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 281.80ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 52.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 59369.31ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 51.6MB in the beginning and 660.6MB in the end (delta: -609.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 33 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 59.2s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 49.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7662 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7662 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7972 IncrementalHoareTripleChecker+Invalid, 8378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 0 mSDtfsCounter, 7972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1489 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 866 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18015 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11442occurred in iteration=19, InterpolantAutomatonStates: 574, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 946 NumberOfCodeBlocks, 946 NumberOfCodeBlocksAsserted, 183 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 5734 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1666 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 43 InterpolantComputations, 7 PerfectInterpolantSequences, 32/3858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:49:27,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...