./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:25:12,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:25:12,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:25:12,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:25:12,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:25:12,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:25:12,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:25:12,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:25:12,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:25:12,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:25:12,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:25:12,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:25:12,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:25:12,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:25:12,567 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:25:12,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:25:12,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:25:12,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:25:12,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:25:12,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:12,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:25:12,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:25:12,570 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-03-04 02:25:12,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:25:12,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:25:12,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:25:12,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:25:12,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:25:12,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-04 02:25:13,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2f8d732/319f473261704d20b410068e71c81b9b/FLAGf8a0f353e [2025-03-04 02:25:14,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:25:14,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-04 02:25:14,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2f8d732/319f473261704d20b410068e71c81b9b/FLAGf8a0f353e [2025-03-04 02:25:14,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2f8d732/319f473261704d20b410068e71c81b9b [2025-03-04 02:25:14,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:25:14,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:25:14,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:14,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:25:14,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:25:14,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14, skipping insertion in model container [2025-03-04 02:25:14,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:25:14,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3081,3094] [2025-03-04 02:25:14,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:14,515 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:25:14,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3081,3094] [2025-03-04 02:25:14,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:14,547 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:25:14,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14 WrapperNode [2025-03-04 02:25:14,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:14,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:14,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:25:14,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:25:14,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,576 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-03-04 02:25:14,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:14,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:25:14,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:25:14,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:25:14,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,602 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:25:14,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:25:14,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:25:14,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:25:14,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:25:14,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (1/1) ... [2025-03-04 02:25:14,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:14,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:25:14,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:25:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:25:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:25:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:25:14,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:25:14,668 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:25:14,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:25:14,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:25:15,005 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:25:15,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:25:15,173 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:25:15,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:25:15,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:15 BoogieIcfgContainer [2025-03-04 02:25:15,174 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:25:15,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:25:15,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:25:15,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:25:15,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:25:14" (1/3) ... [2025-03-04 02:25:15,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f5f7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:15, skipping insertion in model container [2025-03-04 02:25:15,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:14" (2/3) ... [2025-03-04 02:25:15,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f5f7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:15, skipping insertion in model container [2025-03-04 02:25:15,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:15" (3/3) ... [2025-03-04 02:25:15,181 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-03-04 02:25:15,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:25:15,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:25:15,195 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:25:15,238 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:25:15,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-03-04 02:25:15,286 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-04 02:25:15,289 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:15,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-04 02:25:15,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-03-04 02:25:15,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-03-04 02:25:15,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:25:15,309 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fbd49b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:25:15,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:25:15,332 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:25:15,333 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-04 02:25:15,333 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:15,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:15,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:15,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:15,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -994515794, now seen corresponding path program 1 times [2025-03-04 02:25:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055361355] [2025-03-04 02:25:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:25:15,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:15,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055361355] [2025-03-04 02:25:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055361355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:15,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:15,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739338056] [2025-03-04 02:25:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:15,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:15,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:15,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:15,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:15,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:15,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:15,852 INFO L124 PetriNetUnfolderBase]: 466/750 cut-off events. [2025-03-04 02:25:15,852 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-04 02:25:15,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 750 events. 466/750 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3019 event pairs, 171 based on Foata normal form. 28/772 useless extension candidates. Maximal degree in co-relation 1442. Up to 532 conditions per place. [2025-03-04 02:25:15,859 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-03-04 02:25:15,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 200 flow [2025-03-04 02:25:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 02:25:15,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-03-04 02:25:15,871 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 3 states and 64 transitions. [2025-03-04 02:25:15,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 200 flow [2025-03-04 02:25:15,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:15,877 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 87 flow [2025-03-04 02:25:15,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-04 02:25:15,883 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-03-04 02:25:15,883 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 87 flow [2025-03-04 02:25:15,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:15,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:15,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:15,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:25:15,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:15,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash 386452688, now seen corresponding path program 2 times [2025-03-04 02:25:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45425402] [2025-03-04 02:25:15,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:15,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:25:15,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:15,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45425402] [2025-03-04 02:25:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45425402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:25:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637285476] [2025-03-04 02:25:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:16,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:16,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:16,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:16,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:16,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:16,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:16,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:16,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:16,270 INFO L124 PetriNetUnfolderBase]: 587/970 cut-off events. [2025-03-04 02:25:16,271 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-03-04 02:25:16,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 970 events. 587/970 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4302 event pairs, 467 based on Foata normal form. 34/991 useless extension candidates. Maximal degree in co-relation 866. Up to 728 conditions per place. [2025-03-04 02:25:16,280 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 2 changer transitions 15/49 dead transitions. [2025-03-04 02:25:16,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 212 flow [2025-03-04 02:25:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-04 02:25:16,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-04 02:25:16,284 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 87 flow. Second operand 4 states and 73 transitions. [2025-03-04 02:25:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 212 flow [2025-03-04 02:25:16,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:16,285 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 100 flow [2025-03-04 02:25:16,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-04 02:25:16,287 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-03-04 02:25:16,287 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 100 flow [2025-03-04 02:25:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:16,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:16,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:25:16,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1575825723, now seen corresponding path program 1 times [2025-03-04 02:25:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156861053] [2025-03-04 02:25:16,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:16,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:25:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:25:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:16,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:16,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156861053] [2025-03-04 02:25:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156861053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:25:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491343692] [2025-03-04 02:25:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:16,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:16,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:16,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:16,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:16,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:16,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:16,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:16,505 INFO L124 PetriNetUnfolderBase]: 304/517 cut-off events. [2025-03-04 02:25:16,506 INFO L125 PetriNetUnfolderBase]: For 118/122 co-relation queries the response was YES. [2025-03-04 02:25:16,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 517 events. 304/517 cut-off events. For 118/122 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1996 event pairs, 99 based on Foata normal form. 39/550 useless extension candidates. Maximal degree in co-relation 1148. Up to 197 conditions per place. [2025-03-04 02:25:16,508 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-04 02:25:16,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 240 flow [2025-03-04 02:25:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-04 02:25:16,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:25:16,510 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 100 flow. Second operand 4 states and 77 transitions. [2025-03-04 02:25:16,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 240 flow [2025-03-04 02:25:16,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:16,511 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 108 flow [2025-03-04 02:25:16,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-04 02:25:16,512 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-03-04 02:25:16,512 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 108 flow [2025-03-04 02:25:16,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:16,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:16,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:16,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:25:16,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1011553143, now seen corresponding path program 2 times [2025-03-04 02:25:16,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:16,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848324341] [2025-03-04 02:25:16,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:16,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:25:16,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-04 02:25:16,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:17,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848324341] [2025-03-04 02:25:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848324341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:17,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:17,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:17,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213218664] [2025-03-04 02:25:17,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:17,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:17,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:17,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:17,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:17,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:17,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:17,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:17,394 INFO L124 PetriNetUnfolderBase]: 548/921 cut-off events. [2025-03-04 02:25:17,394 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-03-04 02:25:17,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 921 events. 548/921 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4138 event pairs, 123 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 2156. Up to 341 conditions per place. [2025-03-04 02:25:17,399 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 62 selfloop transitions, 14 changer transitions 17/97 dead transitions. [2025-03-04 02:25:17,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 467 flow [2025-03-04 02:25:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-04 02:25:17,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-03-04 02:25:17,400 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 108 flow. Second operand 8 states and 149 transitions. [2025-03-04 02:25:17,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 467 flow [2025-03-04 02:25:17,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 97 transitions, 447 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:17,403 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 207 flow [2025-03-04 02:25:17,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 02:25:17,403 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-04 02:25:17,403 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 207 flow [2025-03-04 02:25:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:17,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:17,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:25:17,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -810646377, now seen corresponding path program 3 times [2025-03-04 02:25:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817710500] [2025-03-04 02:25:17,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:17,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:25:17,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-04 02:25:17,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:17,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:17,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817710500] [2025-03-04 02:25:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817710500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216107553] [2025-03-04 02:25:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:17,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:17,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:17,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:17,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:17,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:17,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:17,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:18,156 INFO L124 PetriNetUnfolderBase]: 742/1250 cut-off events. [2025-03-04 02:25:18,156 INFO L125 PetriNetUnfolderBase]: For 1221/1226 co-relation queries the response was YES. [2025-03-04 02:25:18,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1250 events. 742/1250 cut-off events. For 1221/1226 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6072 event pairs, 185 based on Foata normal form. 6/1254 useless extension candidates. Maximal degree in co-relation 3578. Up to 405 conditions per place. [2025-03-04 02:25:18,167 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 21 changer transitions 17/106 dead transitions. [2025-03-04 02:25:18,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 627 flow [2025-03-04 02:25:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2025-03-04 02:25:18,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-04 02:25:18,170 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 207 flow. Second operand 8 states and 148 transitions. [2025-03-04 02:25:18,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 106 transitions, 627 flow [2025-03-04 02:25:18,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 599 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:18,176 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 355 flow [2025-03-04 02:25:18,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-04 02:25:18,178 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-04 02:25:18,178 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 355 flow [2025-03-04 02:25:18,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:18,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:18,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:18,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:25:18,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 239200147, now seen corresponding path program 4 times [2025-03-04 02:25:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182336201] [2025-03-04 02:25:18,179 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:18,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:25:18,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:25:18,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:18,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182336201] [2025-03-04 02:25:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182336201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660160499] [2025-03-04 02:25:18,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:18,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:18,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:25:18,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:25:18,345 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:25:18,345 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:18,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:18,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:25:18,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:18,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:18,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660160499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:18,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:18,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 02:25:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648856633] [2025-03-04 02:25:18,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:18,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:25:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:18,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:25:18,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:25:18,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:18,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:18,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:18,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:18,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:18,688 INFO L124 PetriNetUnfolderBase]: 1343/2239 cut-off events. [2025-03-04 02:25:18,688 INFO L125 PetriNetUnfolderBase]: For 4167/4167 co-relation queries the response was YES. [2025-03-04 02:25:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 2239 events. 1343/2239 cut-off events. For 4167/4167 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12468 event pairs, 846 based on Foata normal form. 11/2243 useless extension candidates. Maximal degree in co-relation 7310. Up to 1070 conditions per place. [2025-03-04 02:25:18,699 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 51 selfloop transitions, 3 changer transitions 46/104 dead transitions. [2025-03-04 02:25:18,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 873 flow [2025-03-04 02:25:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:25:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:25:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-04 02:25:18,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2025-03-04 02:25:18,700 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 355 flow. Second operand 5 states and 86 transitions. [2025-03-04 02:25:18,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 873 flow [2025-03-04 02:25:18,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 853 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:18,713 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 361 flow [2025-03-04 02:25:18,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-03-04 02:25:18,715 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-03-04 02:25:18,715 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 361 flow [2025-03-04 02:25:18,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:18,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:18,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:18,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:25:18,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:25:18,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -581322612, now seen corresponding path program 5 times [2025-03-04 02:25:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912119152] [2025-03-04 02:25:18,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:18,927 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:18,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:18,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:18,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912119152] [2025-03-04 02:25:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912119152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290633587] [2025-03-04 02:25:20,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:20,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:20,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:25:20,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:20,237 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:20,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:20,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:25:20,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:20,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:20,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:21,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2025-03-04 02:25:21,258 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:25:21,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 129 [2025-03-04 02:25:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290633587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:21,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-04 02:25:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083818632] [2025-03-04 02:25:21,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:25:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:21,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:25:21,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:25:21,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:21,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 361 flow. Second operand has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:21,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:21,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:21,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:24,455 INFO L124 PetriNetUnfolderBase]: 2750/4624 cut-off events. [2025-03-04 02:25:24,455 INFO L125 PetriNetUnfolderBase]: For 7559/7559 co-relation queries the response was YES. [2025-03-04 02:25:24,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14799 conditions, 4624 events. 2750/4624 cut-off events. For 7559/7559 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29020 event pairs, 785 based on Foata normal form. 2/4619 useless extension candidates. Maximal degree in co-relation 14768. Up to 1276 conditions per place. [2025-03-04 02:25:24,480 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 221 selfloop transitions, 73 changer transitions 34/332 dead transitions. [2025-03-04 02:25:24,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 332 transitions, 2329 flow [2025-03-04 02:25:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:25:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:25:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 449 transitions. [2025-03-04 02:25:24,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2025-03-04 02:25:24,484 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 361 flow. Second operand 27 states and 449 transitions. [2025-03-04 02:25:24,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 332 transitions, 2329 flow [2025-03-04 02:25:24,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 332 transitions, 2309 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:24,510 INFO L231 Difference]: Finished difference. Result has 92 places, 129 transitions, 1233 flow [2025-03-04 02:25:24,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1233, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2025-03-04 02:25:24,511 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-03-04 02:25:24,512 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1233 flow [2025-03-04 02:25:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:24,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:24,512 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:24,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:25:24,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:25:24,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:24,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash -8273144, now seen corresponding path program 6 times [2025-03-04 02:25:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:24,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326082583] [2025-03-04 02:25:24,714 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:24,719 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:24,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:25:24,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:24,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:24,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326082583] [2025-03-04 02:25:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326082583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808401855] [2025-03-04 02:25:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:24,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:24,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:24,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:24,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:24,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:24,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1233 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:24,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:24,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:24,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:25,440 INFO L124 PetriNetUnfolderBase]: 2815/4756 cut-off events. [2025-03-04 02:25:25,441 INFO L125 PetriNetUnfolderBase]: For 13143/13143 co-relation queries the response was YES. [2025-03-04 02:25:25,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16791 conditions, 4756 events. 2815/4756 cut-off events. For 13143/13143 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30331 event pairs, 703 based on Foata normal form. 2/4746 useless extension candidates. Maximal degree in co-relation 16745. Up to 1538 conditions per place. [2025-03-04 02:25:25,467 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 68 changer transitions 18/185 dead transitions. [2025-03-04 02:25:25,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 185 transitions, 1791 flow [2025-03-04 02:25:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-04 02:25:25,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:25:25,469 INFO L175 Difference]: Start difference. First operand has 92 places, 129 transitions, 1233 flow. Second operand 8 states and 152 transitions. [2025-03-04 02:25:25,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 185 transitions, 1791 flow [2025-03-04 02:25:25,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 185 transitions, 1685 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:25,518 INFO L231 Difference]: Finished difference. Result has 90 places, 131 transitions, 1317 flow [2025-03-04 02:25:25,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=90, PETRI_TRANSITIONS=131} [2025-03-04 02:25:25,518 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 52 predicate places. [2025-03-04 02:25:25,519 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 131 transitions, 1317 flow [2025-03-04 02:25:25,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:25,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:25,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:25,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:25:25,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:25,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1709147508, now seen corresponding path program 7 times [2025-03-04 02:25:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464623002] [2025-03-04 02:25:25,520 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:25,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:25:25,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:25,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:25,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464623002] [2025-03-04 02:25:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464623002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566949011] [2025-03-04 02:25:26,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:26,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:26,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:26,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:25:26,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:25:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:26,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:25:26,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:26,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:27,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:27,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2025-03-04 02:25:27,681 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:25:27,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 129 [2025-03-04 02:25:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566949011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:27,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-04 02:25:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578122674] [2025-03-04 02:25:27,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:25:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:27,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:25:27,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-04 02:25:27,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:27,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 131 transitions, 1317 flow. Second operand has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:27,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:27,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:27,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:31,707 INFO L124 PetriNetUnfolderBase]: 3414/5893 cut-off events. [2025-03-04 02:25:31,707 INFO L125 PetriNetUnfolderBase]: For 20684/20718 co-relation queries the response was YES. [2025-03-04 02:25:31,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20817 conditions, 5893 events. 3414/5893 cut-off events. For 20684/20718 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39920 event pairs, 911 based on Foata normal form. 36/5926 useless extension candidates. Maximal degree in co-relation 20765. Up to 1946 conditions per place. [2025-03-04 02:25:31,740 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 235 selfloop transitions, 98 changer transitions 34/371 dead transitions. [2025-03-04 02:25:31,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 371 transitions, 3027 flow [2025-03-04 02:25:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:25:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:25:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 518 transitions. [2025-03-04 02:25:31,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-04 02:25:31,747 INFO L175 Difference]: Start difference. First operand has 90 places, 131 transitions, 1317 flow. Second operand 32 states and 518 transitions. [2025-03-04 02:25:31,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 371 transitions, 3027 flow [2025-03-04 02:25:31,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 371 transitions, 2877 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:31,811 INFO L231 Difference]: Finished difference. Result has 123 places, 170 transitions, 1833 flow [2025-03-04 02:25:31,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1833, PETRI_PLACES=123, PETRI_TRANSITIONS=170} [2025-03-04 02:25:31,814 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 85 predicate places. [2025-03-04 02:25:31,814 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 170 transitions, 1833 flow [2025-03-04 02:25:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:31,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:31,815 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:31,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:32,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:32,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -272771400, now seen corresponding path program 8 times [2025-03-04 02:25:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222546310] [2025-03-04 02:25:32,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:32,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:32,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:25:32,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222546310] [2025-03-04 02:25:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222546310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429638577] [2025-03-04 02:25:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:32,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:32,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:32,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:32,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 170 transitions, 1833 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:32,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:32,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:32,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:32,779 INFO L124 PetriNetUnfolderBase]: 3454/5970 cut-off events. [2025-03-04 02:25:32,779 INFO L125 PetriNetUnfolderBase]: For 26186/26215 co-relation queries the response was YES. [2025-03-04 02:25:32,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22504 conditions, 5970 events. 3454/5970 cut-off events. For 26186/26215 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 40217 event pairs, 1026 based on Foata normal form. 31/5998 useless extension candidates. Maximal degree in co-relation 22437. Up to 2549 conditions per place. [2025-03-04 02:25:32,808 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 73 changer transitions 19/221 dead transitions. [2025-03-04 02:25:32,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 221 transitions, 2495 flow [2025-03-04 02:25:32,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-03-04 02:25:32,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2025-03-04 02:25:32,809 INFO L175 Difference]: Start difference. First operand has 123 places, 170 transitions, 1833 flow. Second operand 8 states and 141 transitions. [2025-03-04 02:25:32,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 221 transitions, 2495 flow [2025-03-04 02:25:32,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 2394 flow, removed 44 selfloop flow, removed 9 redundant places. [2025-03-04 02:25:32,906 INFO L231 Difference]: Finished difference. Result has 121 places, 173 transitions, 1945 flow [2025-03-04 02:25:32,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1945, PETRI_PLACES=121, PETRI_TRANSITIONS=173} [2025-03-04 02:25:32,906 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2025-03-04 02:25:32,906 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 173 transitions, 1945 flow [2025-03-04 02:25:32,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:32,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:32,907 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:32,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:25:32,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:32,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2141977109, now seen corresponding path program 1 times [2025-03-04 02:25:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132834253] [2025-03-04 02:25:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:32,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:25:32,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:32,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:32,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:32,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132834253] [2025-03-04 02:25:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132834253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:32,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:25:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560891949] [2025-03-04 02:25:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:32,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:25:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:32,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:25:32,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:25:33,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:33,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 173 transitions, 1945 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:33,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:33,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:33,682 INFO L124 PetriNetUnfolderBase]: 5763/9234 cut-off events. [2025-03-04 02:25:33,682 INFO L125 PetriNetUnfolderBase]: For 43213/43213 co-relation queries the response was YES. [2025-03-04 02:25:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34742 conditions, 9234 events. 5763/9234 cut-off events. For 43213/43213 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 59790 event pairs, 825 based on Foata normal form. 0/8303 useless extension candidates. Maximal degree in co-relation 34681. Up to 4969 conditions per place. [2025-03-04 02:25:33,725 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 286 selfloop transitions, 43 changer transitions 7/338 dead transitions. [2025-03-04 02:25:33,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 338 transitions, 4480 flow [2025-03-04 02:25:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:25:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:25:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-04 02:25:33,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-04 02:25:33,727 INFO L175 Difference]: Start difference. First operand has 121 places, 173 transitions, 1945 flow. Second operand 7 states and 134 transitions. [2025-03-04 02:25:33,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 338 transitions, 4480 flow [2025-03-04 02:25:33,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 338 transitions, 4179 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:33,924 INFO L231 Difference]: Finished difference. Result has 124 places, 198 transitions, 2245 flow [2025-03-04 02:25:33,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2245, PETRI_PLACES=124, PETRI_TRANSITIONS=198} [2025-03-04 02:25:33,925 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2025-03-04 02:25:33,925 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 198 transitions, 2245 flow [2025-03-04 02:25:33,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:33,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:33,925 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:33,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:25:33,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -718200215, now seen corresponding path program 2 times [2025-03-04 02:25:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96440956] [2025-03-04 02:25:33,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:33,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:33,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-04 02:25:33,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:33,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96440956] [2025-03-04 02:25:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96440956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:25:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592209978] [2025-03-04 02:25:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:33,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:25:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:25:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:25:33,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:33,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 198 transitions, 2245 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:33,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:33,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:33,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:34,824 INFO L124 PetriNetUnfolderBase]: 5937/9541 cut-off events. [2025-03-04 02:25:34,824 INFO L125 PetriNetUnfolderBase]: For 44617/44617 co-relation queries the response was YES. [2025-03-04 02:25:34,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40924 conditions, 9541 events. 5937/9541 cut-off events. For 44617/44617 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 62043 event pairs, 2945 based on Foata normal form. 40/9580 useless extension candidates. Maximal degree in co-relation 40042. Up to 7040 conditions per place. [2025-03-04 02:25:34,877 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 228 selfloop transitions, 41 changer transitions 8/279 dead transitions. [2025-03-04 02:25:34,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 279 transitions, 3637 flow [2025-03-04 02:25:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:25:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:25:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-03-04 02:25:34,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-04 02:25:34,879 INFO L175 Difference]: Start difference. First operand has 124 places, 198 transitions, 2245 flow. Second operand 5 states and 90 transitions. [2025-03-04 02:25:34,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 279 transitions, 3637 flow [2025-03-04 02:25:35,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 279 transitions, 3637 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:25:35,223 INFO L231 Difference]: Finished difference. Result has 131 places, 207 transitions, 2484 flow [2025-03-04 02:25:35,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2484, PETRI_PLACES=131, PETRI_TRANSITIONS=207} [2025-03-04 02:25:35,223 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-04 02:25:35,224 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 207 transitions, 2484 flow [2025-03-04 02:25:35,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:35,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:25:35,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -847355128, now seen corresponding path program 1 times [2025-03-04 02:25:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896246034] [2025-03-04 02:25:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:25:35,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:35,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:35,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896246034] [2025-03-04 02:25:35,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896246034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:35,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:25:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143383887] [2025-03-04 02:25:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:35,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:25:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:35,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:25:35,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:25:35,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:35,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 207 transitions, 2484 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:35,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:35,976 INFO L124 PetriNetUnfolderBase]: 5119/8250 cut-off events. [2025-03-04 02:25:35,976 INFO L125 PetriNetUnfolderBase]: For 45746/45746 co-relation queries the response was YES. [2025-03-04 02:25:36,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37975 conditions, 8250 events. 5119/8250 cut-off events. For 45746/45746 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 52655 event pairs, 1930 based on Foata normal form. 165/8414 useless extension candidates. Maximal degree in co-relation 37536. Up to 4689 conditions per place. [2025-03-04 02:25:36,022 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 193 selfloop transitions, 27 changer transitions 31/253 dead transitions. [2025-03-04 02:25:36,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 253 transitions, 3420 flow [2025-03-04 02:25:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:25:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:25:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 02:25:36,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-04 02:25:36,023 INFO L175 Difference]: Start difference. First operand has 131 places, 207 transitions, 2484 flow. Second operand 5 states and 96 transitions. [2025-03-04 02:25:36,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 253 transitions, 3420 flow [2025-03-04 02:25:36,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 253 transitions, 3326 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:36,236 INFO L231 Difference]: Finished difference. Result has 130 places, 177 transitions, 2076 flow [2025-03-04 02:25:36,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2076, PETRI_PLACES=130, PETRI_TRANSITIONS=177} [2025-03-04 02:25:36,237 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-03-04 02:25:36,237 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 177 transitions, 2076 flow [2025-03-04 02:25:36,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:36,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:36,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:25:36,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 882399051, now seen corresponding path program 3 times [2025-03-04 02:25:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-04 02:25:36,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:36,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:36,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:36,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:36,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:36,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127179866] [2025-03-04 02:25:36,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127179866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:36,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:36,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:25:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036929080] [2025-03-04 02:25:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:36,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:36,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:36,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:36,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:36,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 177 transitions, 2076 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:36,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:36,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:36,824 INFO L124 PetriNetUnfolderBase]: 4809/7715 cut-off events. [2025-03-04 02:25:36,824 INFO L125 PetriNetUnfolderBase]: For 43531/43531 co-relation queries the response was YES. [2025-03-04 02:25:36,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35307 conditions, 7715 events. 4809/7715 cut-off events. For 43531/43531 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47631 event pairs, 2119 based on Foata normal form. 146/7860 useless extension candidates. Maximal degree in co-relation 34851. Up to 4874 conditions per place. [2025-03-04 02:25:36,869 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 189 selfloop transitions, 35 changer transitions 5/231 dead transitions. [2025-03-04 02:25:36,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 231 transitions, 3087 flow [2025-03-04 02:25:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-04 02:25:36,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:25:36,871 INFO L175 Difference]: Start difference. First operand has 130 places, 177 transitions, 2076 flow. Second operand 4 states and 77 transitions. [2025-03-04 02:25:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 231 transitions, 3087 flow [2025-03-04 02:25:37,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 231 transitions, 2912 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:37,059 INFO L231 Difference]: Finished difference. Result has 126 places, 171 transitions, 1936 flow [2025-03-04 02:25:37,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1936, PETRI_PLACES=126, PETRI_TRANSITIONS=171} [2025-03-04 02:25:37,060 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2025-03-04 02:25:37,060 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 171 transitions, 1936 flow [2025-03-04 02:25:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:37,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:37,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:25:37,060 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:37,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash -336980145, now seen corresponding path program 4 times [2025-03-04 02:25:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153606635] [2025-03-04 02:25:37,060 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:37,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:37,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:37,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:37,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153606635] [2025-03-04 02:25:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153606635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978440497] [2025-03-04 02:25:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:25:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:37,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:25:37,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:25:37,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:37,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 171 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:37,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:37,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:38,086 INFO L124 PetriNetUnfolderBase]: 5037/8050 cut-off events. [2025-03-04 02:25:38,086 INFO L125 PetriNetUnfolderBase]: For 43002/43002 co-relation queries the response was YES. [2025-03-04 02:25:38,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38097 conditions, 8050 events. 5037/8050 cut-off events. For 43002/43002 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 50044 event pairs, 1198 based on Foata normal form. 40/8089 useless extension candidates. Maximal degree in co-relation 37701. Up to 2978 conditions per place. [2025-03-04 02:25:38,144 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 218 selfloop transitions, 68 changer transitions 3/291 dead transitions. [2025-03-04 02:25:38,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 291 transitions, 3745 flow [2025-03-04 02:25:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-03-04 02:25:38,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-04 02:25:38,145 INFO L175 Difference]: Start difference. First operand has 126 places, 171 transitions, 1936 flow. Second operand 8 states and 128 transitions. [2025-03-04 02:25:38,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 291 transitions, 3745 flow [2025-03-04 02:25:38,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 291 transitions, 3662 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:38,353 INFO L231 Difference]: Finished difference. Result has 130 places, 199 transitions, 2419 flow [2025-03-04 02:25:38,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2419, PETRI_PLACES=130, PETRI_TRANSITIONS=199} [2025-03-04 02:25:38,353 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-03-04 02:25:38,353 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 199 transitions, 2419 flow [2025-03-04 02:25:38,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:38,354 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:25:38,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:38,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1026019527, now seen corresponding path program 5 times [2025-03-04 02:25:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949427348] [2025-03-04 02:25:38,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:38,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:38,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:38,365 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:38,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949427348] [2025-03-04 02:25:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949427348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:38,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:25:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011836378] [2025-03-04 02:25:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:38,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:25:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:38,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:25:38,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:25:38,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-04 02:25:38,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 199 transitions, 2419 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:38,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-04 02:25:38,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:39,092 INFO L124 PetriNetUnfolderBase]: 4449/7124 cut-off events. [2025-03-04 02:25:39,093 INFO L125 PetriNetUnfolderBase]: For 41451/41451 co-relation queries the response was YES. [2025-03-04 02:25:39,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35355 conditions, 7124 events. 4449/7124 cut-off events. For 41451/41451 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 42350 event pairs, 1587 based on Foata normal form. 64/7187 useless extension candidates. Maximal degree in co-relation 34873. Up to 3609 conditions per place. [2025-03-04 02:25:39,129 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 166 selfloop transitions, 40 changer transitions 12/220 dead transitions. [2025-03-04 02:25:39,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 2955 flow [2025-03-04 02:25:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 02:25:39,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:25:39,130 INFO L175 Difference]: Start difference. First operand has 130 places, 199 transitions, 2419 flow. Second operand 4 states and 80 transitions. [2025-03-04 02:25:39,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 2955 flow [2025-03-04 02:25:39,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 2897 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:39,279 INFO L231 Difference]: Finished difference. Result has 131 places, 178 transitions, 2156 flow [2025-03-04 02:25:39,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2156, PETRI_PLACES=131, PETRI_TRANSITIONS=178} [2025-03-04 02:25:39,279 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-04 02:25:39,280 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 178 transitions, 2156 flow [2025-03-04 02:25:39,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:39,280 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:39,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:25:39,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:39,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -357089526, now seen corresponding path program 9 times [2025-03-04 02:25:39,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:39,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835033581] [2025-03-04 02:25:39,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:39,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 02:25:39,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-04 02:25:39,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:39,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:25:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835033581] [2025-03-04 02:25:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835033581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:25:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064486214] [2025-03-04 02:25:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:39,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:39,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:39,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:39,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:39,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 178 transitions, 2156 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:39,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:39,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:40,068 INFO L124 PetriNetUnfolderBase]: 3377/5827 cut-off events. [2025-03-04 02:25:40,068 INFO L125 PetriNetUnfolderBase]: For 35822/35983 co-relation queries the response was YES. [2025-03-04 02:25:40,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28548 conditions, 5827 events. 3377/5827 cut-off events. For 35822/35983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38418 event pairs, 1078 based on Foata normal form. 5/5737 useless extension candidates. Maximal degree in co-relation 28232. Up to 2379 conditions per place. [2025-03-04 02:25:40,109 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 51 changer transitions 31/232 dead transitions. [2025-03-04 02:25:40,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 232 transitions, 2872 flow [2025-03-04 02:25:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-03-04 02:25:40,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-04 02:25:40,110 INFO L175 Difference]: Start difference. First operand has 131 places, 178 transitions, 2156 flow. Second operand 8 states and 142 transitions. [2025-03-04 02:25:40,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 232 transitions, 2872 flow [2025-03-04 02:25:40,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 232 transitions, 2751 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:40,203 INFO L231 Difference]: Finished difference. Result has 131 places, 174 transitions, 2104 flow [2025-03-04 02:25:40,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2104, PETRI_PLACES=131, PETRI_TRANSITIONS=174} [2025-03-04 02:25:40,204 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-04 02:25:40,204 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 174 transitions, 2104 flow [2025-03-04 02:25:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:40,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:40,204 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:25:40,204 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:40,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1784183806, now seen corresponding path program 10 times [2025-03-04 02:25:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725724863] [2025-03-04 02:25:40,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:40,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:25:40,255 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:40,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:44,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725724863] [2025-03-04 02:25:44,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725724863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:44,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042624571] [2025-03-04 02:25:44,232 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:44,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:44,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:44,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:44,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:25:44,276 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:25:44,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:44,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:44,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:44,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:25:44,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:44,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:44,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-03-04 02:25:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:25:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042624571] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:25:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 12] total 31 [2025-03-04 02:25:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359849661] [2025-03-04 02:25:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:44,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:44,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:44,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:25:44,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:44,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 174 transitions, 2104 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:44,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:45,396 INFO L124 PetriNetUnfolderBase]: 3296/5680 cut-off events. [2025-03-04 02:25:45,396 INFO L125 PetriNetUnfolderBase]: For 34575/34726 co-relation queries the response was YES. [2025-03-04 02:25:45,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27825 conditions, 5680 events. 3296/5680 cut-off events. For 34575/34726 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37172 event pairs, 1015 based on Foata normal form. 29/5643 useless extension candidates. Maximal degree in co-relation 27776. Up to 2342 conditions per place. [2025-03-04 02:25:45,438 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 112 selfloop transitions, 68 changer transitions 28/224 dead transitions. [2025-03-04 02:25:45,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 224 transitions, 2784 flow [2025-03-04 02:25:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-03-04 02:25:45,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:25:45,439 INFO L175 Difference]: Start difference. First operand has 131 places, 174 transitions, 2104 flow. Second operand 8 states and 140 transitions. [2025-03-04 02:25:45,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 224 transitions, 2784 flow [2025-03-04 02:25:45,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 224 transitions, 2668 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:45,517 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 2036 flow [2025-03-04 02:25:45,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2036, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2025-03-04 02:25:45,518 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2025-03-04 02:25:45,518 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 2036 flow [2025-03-04 02:25:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:45,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:45,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:45,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:25:45,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:25:45,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 144310257, now seen corresponding path program 1 times [2025-03-04 02:25:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900789445] [2025-03-04 02:25:45,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:25:45,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:25:45,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:45,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:46,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:46,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900789445] [2025-03-04 02:25:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900789445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:46,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438488099] [2025-03-04 02:25:46,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:46,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:46,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:25:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:25:46,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:25:46,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:46,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:46,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:25:46,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:46,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:47,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:48,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2025-03-04 02:25:48,099 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:25:48,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 144 [2025-03-04 02:25:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438488099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:48,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-03-04 02:25:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357723586] [2025-03-04 02:25:48,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:48,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 02:25:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:48,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 02:25:48,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 02:25:48,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:48,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 2036 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:48,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:48,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:48,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:53,643 INFO L124 PetriNetUnfolderBase]: 4404/7546 cut-off events. [2025-03-04 02:25:53,643 INFO L125 PetriNetUnfolderBase]: For 45726/45990 co-relation queries the response was YES. [2025-03-04 02:25:53,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36313 conditions, 7546 events. 4404/7546 cut-off events. For 45726/45990 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 51308 event pairs, 1185 based on Foata normal form. 32/7471 useless extension candidates. Maximal degree in co-relation 36262. Up to 1348 conditions per place. [2025-03-04 02:25:53,689 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 360 selfloop transitions, 106 changer transitions 54/536 dead transitions. [2025-03-04 02:25:53,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 536 transitions, 5512 flow [2025-03-04 02:25:53,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 02:25:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 02:25:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 652 transitions. [2025-03-04 02:25:53,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4543554006968641 [2025-03-04 02:25:53,691 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 2036 flow. Second operand 41 states and 652 transitions. [2025-03-04 02:25:53,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 536 transitions, 5512 flow [2025-03-04 02:25:53,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 536 transitions, 5332 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-03-04 02:25:53,775 INFO L231 Difference]: Finished difference. Result has 167 places, 214 transitions, 2676 flow [2025-03-04 02:25:53,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2676, PETRI_PLACES=167, PETRI_TRANSITIONS=214} [2025-03-04 02:25:53,776 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2025-03-04 02:25:53,776 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 214 transitions, 2676 flow [2025-03-04 02:25:53,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:53,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:53,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:53,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:25:53,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:53,977 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1958595935, now seen corresponding path program 2 times [2025-03-04 02:25:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457960391] [2025-03-04 02:25:53,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:53,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:25:53,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:25:53,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:53,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457960391] [2025-03-04 02:25:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457960391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335661952] [2025-03-04 02:25:54,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:54,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:25:54,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:25:54,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:25:54,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:54,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:25:54,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:54,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:55,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:55,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-04 02:25:55,857 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:25:55,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 134 [2025-03-04 02:25:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335661952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:56,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:56,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-03-04 02:25:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708700713] [2025-03-04 02:25:56,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 02:25:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 02:25:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:25:56,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:25:56,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 214 transitions, 2676 flow. Second operand has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:56,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:56,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:25:56,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:02,077 INFO L124 PetriNetUnfolderBase]: 6208/10522 cut-off events. [2025-03-04 02:26:02,077 INFO L125 PetriNetUnfolderBase]: For 79678/80070 co-relation queries the response was YES. [2025-03-04 02:26:02,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54550 conditions, 10522 events. 6208/10522 cut-off events. For 79678/80070 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 74179 event pairs, 1383 based on Foata normal form. 41/10395 useless extension candidates. Maximal degree in co-relation 54480. Up to 2015 conditions per place. [2025-03-04 02:26:02,141 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 442 selfloop transitions, 159 changer transitions 51/668 dead transitions. [2025-03-04 02:26:02,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 668 transitions, 7381 flow [2025-03-04 02:26:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 02:26:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-04 02:26:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 768 transitions. [2025-03-04 02:26:02,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4668693009118541 [2025-03-04 02:26:02,143 INFO L175 Difference]: Start difference. First operand has 167 places, 214 transitions, 2676 flow. Second operand 47 states and 768 transitions. [2025-03-04 02:26:02,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 668 transitions, 7381 flow [2025-03-04 02:26:02,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 668 transitions, 7019 flow, removed 129 selfloop flow, removed 21 redundant places. [2025-03-04 02:26:02,348 INFO L231 Difference]: Finished difference. Result has 203 places, 281 transitions, 3898 flow [2025-03-04 02:26:02,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3898, PETRI_PLACES=203, PETRI_TRANSITIONS=281} [2025-03-04 02:26:02,349 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 165 predicate places. [2025-03-04 02:26:02,349 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 281 transitions, 3898 flow [2025-03-04 02:26:02,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:02,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:02,349 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:02,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:02,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:02,550 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:02,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1836147287, now seen corresponding path program 3 times [2025-03-04 02:26:02,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:02,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850552141] [2025-03-04 02:26:02,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:02,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:02,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:02,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:02,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850552141] [2025-03-04 02:26:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850552141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234742987] [2025-03-04 02:26:03,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:03,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:03,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:26:03,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:03,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:03,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:03,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:03,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 02:26:03,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:03,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 02:26:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:03,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:04,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2025-03-04 02:26:04,609 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-04 02:26:04,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 147 [2025-03-04 02:26:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234742987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:05,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-03-04 02:26:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474815115] [2025-03-04 02:26:05,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 02:26:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:05,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 02:26:05,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 02:26:05,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:26:05,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 281 transitions, 3898 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:05,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:05,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:26:05,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:08,200 INFO L124 PetriNetUnfolderBase]: 6487/11040 cut-off events. [2025-03-04 02:26:08,200 INFO L125 PetriNetUnfolderBase]: For 90845/91291 co-relation queries the response was YES. [2025-03-04 02:26:08,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58625 conditions, 11040 events. 6487/11040 cut-off events. For 90845/91291 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 79233 event pairs, 2583 based on Foata normal form. 66/10939 useless extension candidates. Maximal degree in co-relation 58528. Up to 5069 conditions per place. [2025-03-04 02:26:08,280 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 339 selfloop transitions, 57 changer transitions 17/429 dead transitions. [2025-03-04 02:26:08,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 429 transitions, 5592 flow [2025-03-04 02:26:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:26:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:26:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 295 transitions. [2025-03-04 02:26:08,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-04 02:26:08,282 INFO L175 Difference]: Start difference. First operand has 203 places, 281 transitions, 3898 flow. Second operand 18 states and 295 transitions. [2025-03-04 02:26:08,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 429 transitions, 5592 flow [2025-03-04 02:26:08,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 429 transitions, 5075 flow, removed 207 selfloop flow, removed 20 redundant places. [2025-03-04 02:26:08,621 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3667 flow [2025-03-04 02:26:08,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3431, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3667, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2025-03-04 02:26:08,621 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2025-03-04 02:26:08,621 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3667 flow [2025-03-04 02:26:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:08,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:08,622 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:08,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:26:08,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:08,822 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:08,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2068442959, now seen corresponding path program 4 times [2025-03-04 02:26:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256785787] [2025-03-04 02:26:08,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:08,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:08,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:08,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256785787] [2025-03-04 02:26:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256785787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163785929] [2025-03-04 02:26:09,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:09,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:09,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:26:09,829 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:09,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:09,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:09,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:09,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 02:26:09,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:09,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:26:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:10,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:10,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-04 02:26:10,748 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:26:10,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-03-04 02:26:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163785929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-04 02:26:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983436141] [2025-03-04 02:26:10,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 02:26:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 02:26:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 02:26:10,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:26:10,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 3667 flow. Second operand has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:10,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:10,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:26:10,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:14,462 INFO L124 PetriNetUnfolderBase]: 7273/12485 cut-off events. [2025-03-04 02:26:14,462 INFO L125 PetriNetUnfolderBase]: For 75316/75790 co-relation queries the response was YES. [2025-03-04 02:26:14,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60860 conditions, 12485 events. 7273/12485 cut-off events. For 75316/75790 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 90117 event pairs, 1660 based on Foata normal form. 49/12350 useless extension candidates. Maximal degree in co-relation 60766. Up to 2230 conditions per place. [2025-03-04 02:26:14,574 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 436 selfloop transitions, 172 changer transitions 66/690 dead transitions. [2025-03-04 02:26:14,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 690 transitions, 7580 flow [2025-03-04 02:26:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 02:26:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 02:26:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 744 transitions. [2025-03-04 02:26:14,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462111801242236 [2025-03-04 02:26:14,576 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3667 flow. Second operand 46 states and 744 transitions. [2025-03-04 02:26:14,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 690 transitions, 7580 flow [2025-03-04 02:26:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 690 transitions, 7487 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-03-04 02:26:14,920 INFO L231 Difference]: Finished difference. Result has 245 places, 314 transitions, 4297 flow [2025-03-04 02:26:14,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4297, PETRI_PLACES=245, PETRI_TRANSITIONS=314} [2025-03-04 02:26:14,920 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 207 predicate places. [2025-03-04 02:26:14,920 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 314 transitions, 4297 flow [2025-03-04 02:26:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:14,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:14,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:14,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:26:15,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 02:26:15,121 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1065766943, now seen corresponding path program 5 times [2025-03-04 02:26:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996886099] [2025-03-04 02:26:15,122 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:15,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:15,139 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:15,139 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996886099] [2025-03-04 02:26:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996886099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891195747] [2025-03-04 02:26:16,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:16,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:16,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:26:16,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:16,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:16,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:16,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:16,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:26:16,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:16,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:26:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:16,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:17,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-04 02:26:17,266 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:26:17,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-03-04 02:26:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891195747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:17,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-03-04 02:26:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064121890] [2025-03-04 02:26:17,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:17,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 02:26:17,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:17,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 02:26:17,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 02:26:17,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:26:17,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 314 transitions, 4297 flow. Second operand has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:17,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:17,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:26:17,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:25,183 INFO L124 PetriNetUnfolderBase]: 7410/12739 cut-off events. [2025-03-04 02:26:25,183 INFO L125 PetriNetUnfolderBase]: For 89138/89630 co-relation queries the response was YES. [2025-03-04 02:26:25,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 12739 events. 7410/12739 cut-off events. For 89138/89630 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 93228 event pairs, 1710 based on Foata normal form. 73/12626 useless extension candidates. Maximal degree in co-relation 64573. Up to 2252 conditions per place. [2025-03-04 02:26:25,283 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 390 selfloop transitions, 166 changer transitions 34/606 dead transitions. [2025-03-04 02:26:25,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 606 transitions, 7345 flow [2025-03-04 02:26:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:26:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:26:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 562 transitions. [2025-03-04 02:26:25,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722689075630252 [2025-03-04 02:26:25,284 INFO L175 Difference]: Start difference. First operand has 245 places, 314 transitions, 4297 flow. Second operand 34 states and 562 transitions. [2025-03-04 02:26:25,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 606 transitions, 7345 flow [2025-03-04 02:26:25,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 606 transitions, 7046 flow, removed 51 selfloop flow, removed 32 redundant places. [2025-03-04 02:26:25,663 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 4586 flow [2025-03-04 02:26:25,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4586, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2025-03-04 02:26:25,664 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 208 predicate places. [2025-03-04 02:26:25,664 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 4586 flow [2025-03-04 02:26:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:25,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:25,664 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:25,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:26:25,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:25,864 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -645207037, now seen corresponding path program 6 times [2025-03-04 02:26:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798636960] [2025-03-04 02:26:25,865 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:25,869 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:25,886 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:25,887 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:26:25,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798636960] [2025-03-04 02:26:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798636960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416415760] [2025-03-04 02:26:26,409 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:26,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:26,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:26,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:26:26,451 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:26:26,465 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:26,465 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:26:26,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:26,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:26:26,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:26,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:26:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:26,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-04 02:26:27,332 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-04 02:26:27,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 142 [2025-03-04 02:26:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416415760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:27,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-03-04 02:26:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908605480] [2025-03-04 02:26:27,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:27,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 02:26:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:27,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 02:26:27,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:26:27,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-04 02:26:27,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 4586 flow. Second operand has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:27,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:27,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-04 02:26:27,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:31,987 INFO L124 PetriNetUnfolderBase]: 7703/13273 cut-off events. [2025-03-04 02:26:31,987 INFO L125 PetriNetUnfolderBase]: For 98109/98618 co-relation queries the response was YES. [2025-03-04 02:26:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67562 conditions, 13273 events. 7703/13273 cut-off events. For 98109/98618 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 97576 event pairs, 2411 based on Foata normal form. 43/13113 useless extension candidates. Maximal degree in co-relation 67446. Up to 2339 conditions per place. [2025-03-04 02:26:32,078 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 441 selfloop transitions, 160 changer transitions 51/668 dead transitions. [2025-03-04 02:26:32,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 668 transitions, 7961 flow [2025-03-04 02:26:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 02:26:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 02:26:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 696 transitions. [2025-03-04 02:26:32,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2025-03-04 02:26:32,080 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 4586 flow. Second operand 44 states and 696 transitions. [2025-03-04 02:26:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 668 transitions, 7961 flow [2025-03-04 02:26:32,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 668 transitions, 7743 flow, removed 23 selfloop flow, removed 21 redundant places. [2025-03-04 02:26:32,539 INFO L231 Difference]: Finished difference. Result has 271 places, 335 transitions, 4859 flow [2025-03-04 02:26:32,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4400, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4859, PETRI_PLACES=271, PETRI_TRANSITIONS=335} [2025-03-04 02:26:32,539 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 233 predicate places. [2025-03-04 02:26:32,539 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 335 transitions, 4859 flow [2025-03-04 02:26:32,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:32,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:32,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:32,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:26:32,740 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2017783473, now seen corresponding path program 7 times [2025-03-04 02:26:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308222059] [2025-03-04 02:26:32,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:32,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:26:32,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:32,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308222059] [2025-03-04 02:26:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308222059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592065347] [2025-03-04 02:26:34,125 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:34,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:34,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:34,126 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:34,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:26:34,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:26:34,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:26:34,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:34,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:26:34,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:26:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:34,589 INFO L312 TraceCheckSpWp]: Computing backward predicates...