./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:42:59,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:42:59,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:42:59,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:42:59,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:42:59,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:42:59,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:42:59,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:42:59,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:42:59,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:42:59,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:42:59,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:42:59,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:42:59,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:42:59,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:42:59,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:42:59,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:42:59,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:42:59,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:42:59,365 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-jdk21/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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-02-06 04:42:59,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:42:59,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:42:59,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:42:59,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:42:59,579 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:42:59,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-02-06 04:43:00,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014e50363/513273800b004a71a52fe6e0864a78d1/FLAG5be8f8514 [2025-02-06 04:43:00,995 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:43:00,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-02-06 04:43:01,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014e50363/513273800b004a71a52fe6e0864a78d1/FLAG5be8f8514 [2025-02-06 04:43:01,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014e50363/513273800b004a71a52fe6e0864a78d1 [2025-02-06 04:43:01,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:43:01,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:43:01,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:01,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:43:01,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:43:01,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498b68a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01, skipping insertion in model container [2025-02-06 04:43:01,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:43:01,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2025-02-06 04:43:01,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:01,243 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:43:01,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2025-02-06 04:43:01,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:01,280 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:43:01,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01 WrapperNode [2025-02-06 04:43:01,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:01,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:01,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:43:01,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:43:01,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,316 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-02-06 04:43:01,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:01,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:43:01,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:43:01,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:43:01,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,348 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 04:43:01,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:43:01,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:43:01,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:43:01,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:43:01,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (1/1) ... [2025-02-06 04:43:01,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:01,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:43:01,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:43:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:43:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:43:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:43:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:43:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:43:01,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:43:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:43:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:43:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:43:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:43:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:43:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:43:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:43:01,419 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:43:01,505 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:43:01,506 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:43:01,790 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:43:01,790 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:43:01,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:43:01,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:43:01,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:01 BoogieIcfgContainer [2025-02-06 04:43:01,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:43:01,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:43:01,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:43:01,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:43:01,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:43:01" (1/3) ... [2025-02-06 04:43:01,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c409c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:01, skipping insertion in model container [2025-02-06 04:43:01,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:01" (2/3) ... [2025-02-06 04:43:01,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c409c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:01, skipping insertion in model container [2025-02-06 04:43:01,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:01" (3/3) ... [2025-02-06 04:43:01,998 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-02-06 04:43:02,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:43:02,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 04:43:02,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:43:02,051 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:43:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 109 flow [2025-02-06 04:43:02,106 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-02-06 04:43:02,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:02,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 7/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-06 04:43:02,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 109 flow [2025-02-06 04:43:02,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 98 flow [2025-02-06 04:43:02,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:43:02,133 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;@64a7f2fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:43:02,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:43:02,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:43:02,167 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-02-06 04:43:02,167 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:43:02,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:02,168 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-02-06 04:43:02,168 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-02-06 04:43:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1112117864, now seen corresponding path program 1 times [2025-02-06 04:43:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858940711] [2025-02-06 04:43:02,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:43:02,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:02,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:02,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858940711] [2025-02-06 04:43:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858940711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753203873] [2025-02-06 04:43:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:02,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:43:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:43:02,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:43:02,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:02,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:02,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:02,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:02,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:02,561 INFO L124 PetriNetUnfolderBase]: 745/1321 cut-off events. [2025-02-06 04:43:02,562 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 04:43:02,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1321 events. 745/1321 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6829 event pairs, 595 based on Foata normal form. 130/1314 useless extension candidates. Maximal degree in co-relation 2250. Up to 991 conditions per place. [2025-02-06 04:43:02,575 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 28 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-02-06 04:43:02,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 150 flow [2025-02-06 04:43:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:43:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:43:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2025-02-06 04:43:02,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 04:43:02,588 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 2 states and 56 transitions. [2025-02-06 04:43:02,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 150 flow [2025-02-06 04:43:02,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:43:02,596 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 82 flow [2025-02-06 04:43:02,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-02-06 04:43:02,601 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-02-06 04:43:02,601 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 82 flow [2025-02-06 04:43:02,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:02,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:02,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:02,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:43:02,603 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-02-06 04:43:02,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1301350298, now seen corresponding path program 1 times [2025-02-06 04:43:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885522303] [2025-02-06 04:43:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:02,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:43:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:43:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:02,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:02,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885522303] [2025-02-06 04:43:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885522303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:02,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191288654] [2025-02-06 04:43:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:02,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:02,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:02,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:02,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:02,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:02,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:02,934 INFO L124 PetriNetUnfolderBase]: 699/1299 cut-off events. [2025-02-06 04:43:02,934 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 04:43:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2332 conditions, 1299 events. 699/1299 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6871 event pairs, 234 based on Foata normal form. 39/1225 useless extension candidates. Maximal degree in co-relation 2329. Up to 657 conditions per place. [2025-02-06 04:43:02,940 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-02-06 04:43:02,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 192 flow [2025-02-06 04:43:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-06 04:43:02,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 04:43:02,942 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 82 flow. Second operand 3 states and 81 transitions. [2025-02-06 04:43:02,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 192 flow [2025-02-06 04:43:02,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:02,944 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 94 flow [2025-02-06 04:43:02,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-02-06 04:43:02,944 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-02-06 04:43:02,944 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 94 flow [2025-02-06 04:43:02,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:02,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:02,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:43:02,945 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-02-06 04:43:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1639447324, now seen corresponding path program 2 times [2025-02-06 04:43:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970525021] [2025-02-06 04:43:02,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:02,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:43:02,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:43:02,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970525021] [2025-02-06 04:43:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970525021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190471775] [2025-02-06 04:43:03,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:03,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:03,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:03,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:03,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:03,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:03,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:03,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:03,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:03,340 INFO L124 PetriNetUnfolderBase]: 748/1402 cut-off events. [2025-02-06 04:43:03,340 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-02-06 04:43:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2723 conditions, 1402 events. 748/1402 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7445 event pairs, 591 based on Foata normal form. 42/1329 useless extension candidates. Maximal degree in co-relation 2718. Up to 988 conditions per place. [2025-02-06 04:43:03,346 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 28 selfloop transitions, 2 changer transitions 15/55 dead transitions. [2025-02-06 04:43:03,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 219 flow [2025-02-06 04:43:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:43:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:43:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-02-06 04:43:03,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-02-06 04:43:03,348 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 94 flow. Second operand 5 states and 112 transitions. [2025-02-06 04:43:03,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 219 flow [2025-02-06 04:43:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:03,349 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 114 flow [2025-02-06 04:43:03,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-02-06 04:43:03,349 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-02-06 04:43:03,349 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 114 flow [2025-02-06 04:43:03,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:03,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:03,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:03,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:43:03,350 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-02-06 04:43:03,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2005770, now seen corresponding path program 1 times [2025-02-06 04:43:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526396779] [2025-02-06 04:43:03,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:03,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:43:03,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:43:03,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:03,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:03,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526396779] [2025-02-06 04:43:03,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526396779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:03,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:03,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144243433] [2025-02-06 04:43:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:03,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:03,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:03,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:03,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:03,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:03,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:03,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:03,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:03,718 INFO L124 PetriNetUnfolderBase]: 899/1662 cut-off events. [2025-02-06 04:43:03,718 INFO L125 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2025-02-06 04:43:03,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1662 events. 899/1662 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9182 event pairs, 724 based on Foata normal form. 38/1580 useless extension candidates. Maximal degree in co-relation 3478. Up to 989 conditions per place. [2025-02-06 04:43:03,725 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 29 selfloop transitions, 2 changer transitions 17/58 dead transitions. [2025-02-06 04:43:03,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 260 flow [2025-02-06 04:43:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-06 04:43:03,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-06 04:43:03,726 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 114 flow. Second operand 4 states and 99 transitions. [2025-02-06 04:43:03,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 260 flow [2025-02-06 04:43:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 248 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:03,728 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 120 flow [2025-02-06 04:43:03,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-02-06 04:43:03,728 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2025-02-06 04:43:03,728 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 120 flow [2025-02-06 04:43:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:03,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:03,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:03,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:43:03,729 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-02-06 04:43:03,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1621266381, now seen corresponding path program 1 times [2025-02-06 04:43:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829422297] [2025-02-06 04:43:03,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:03,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:43:03,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:43:03,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:03,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829422297] [2025-02-06 04:43:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829422297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:43:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853041718] [2025-02-06 04:43:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:43:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:03,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:43:03,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:43:03,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:43:03,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:03,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:03,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:43:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:04,284 INFO L124 PetriNetUnfolderBase]: 1634/2687 cut-off events. [2025-02-06 04:43:04,284 INFO L125 PetriNetUnfolderBase]: For 830/868 co-relation queries the response was YES. [2025-02-06 04:43:04,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6093 conditions, 2687 events. 1634/2687 cut-off events. For 830/868 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15647 event pairs, 455 based on Foata normal form. 1/2569 useless extension candidates. Maximal degree in co-relation 6084. Up to 844 conditions per place. [2025-02-06 04:43:04,294 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 80 selfloop transitions, 9 changer transitions 11/108 dead transitions. [2025-02-06 04:43:04,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 515 flow [2025-02-06 04:43:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:43:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:43:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2025-02-06 04:43:04,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 04:43:04,295 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 120 flow. Second operand 8 states and 184 transitions. [2025-02-06 04:43:04,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 515 flow [2025-02-06 04:43:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 505 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:04,298 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 172 flow [2025-02-06 04:43:04,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2025-02-06 04:43:04,298 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2025-02-06 04:43:04,298 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 172 flow [2025-02-06 04:43:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:04,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:04,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:43:04,299 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-02-06 04:43:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1047495347, now seen corresponding path program 2 times [2025-02-06 04:43:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250865514] [2025-02-06 04:43:04,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:04,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:43:04,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:43:04,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250865514] [2025-02-06 04:43:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250865514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724490571] [2025-02-06 04:43:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:04,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:04,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:04,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:04,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:04,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:04,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:04,478 INFO L124 PetriNetUnfolderBase]: 1022/1928 cut-off events. [2025-02-06 04:43:04,478 INFO L125 PetriNetUnfolderBase]: For 825/828 co-relation queries the response was YES. [2025-02-06 04:43:04,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 1928 events. 1022/1928 cut-off events. For 825/828 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10971 event pairs, 369 based on Foata normal form. 15/1851 useless extension candidates. Maximal degree in co-relation 4569. Up to 1393 conditions per place. [2025-02-06 04:43:04,487 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 40 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-02-06 04:43:04,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 278 flow [2025-02-06 04:43:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-02-06 04:43:04,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-06 04:43:04,489 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 172 flow. Second operand 3 states and 78 transitions. [2025-02-06 04:43:04,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 278 flow [2025-02-06 04:43:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:04,491 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 183 flow [2025-02-06 04:43:04,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-02-06 04:43:04,491 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-02-06 04:43:04,491 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 183 flow [2025-02-06 04:43:04,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:04,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:04,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:43:04,492 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-02-06 04:43:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash 744751055, now seen corresponding path program 1 times [2025-02-06 04:43:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494267253] [2025-02-06 04:43:04,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:04,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:43:04,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:43:04,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494267253] [2025-02-06 04:43:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494267253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722598638] [2025-02-06 04:43:04,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:04,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:04,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:43:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:43:04,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:43:04,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:04,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:04,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:43:04,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:04,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:04,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722598638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:04,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 04:43:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243904167] [2025-02-06 04:43:04,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:43:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:43:04,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:43:04,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:04,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 183 flow. Second operand has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:04,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:04,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:04,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:05,103 INFO L124 PetriNetUnfolderBase]: 1661/3274 cut-off events. [2025-02-06 04:43:05,103 INFO L125 PetriNetUnfolderBase]: For 2288/2298 co-relation queries the response was YES. [2025-02-06 04:43:05,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8085 conditions, 3274 events. 1661/3274 cut-off events. For 2288/2298 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 21755 event pairs, 1040 based on Foata normal form. 113/3235 useless extension candidates. Maximal degree in co-relation 8073. Up to 1488 conditions per place. [2025-02-06 04:43:05,117 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 65 selfloop transitions, 6 changer transitions 4/88 dead transitions. [2025-02-06 04:43:05,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 470 flow [2025-02-06 04:43:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:43:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:43:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-02-06 04:43:05,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-02-06 04:43:05,118 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 183 flow. Second operand 7 states and 157 transitions. [2025-02-06 04:43:05,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 470 flow [2025-02-06 04:43:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 449 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:05,122 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 223 flow [2025-02-06 04:43:05,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2025-02-06 04:43:05,123 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-02-06 04:43:05,123 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 223 flow [2025-02-06 04:43:05,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:05,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:05,123 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, 1, 1, 1, 1, 1] [2025-02-06 04:43:05,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:43:05,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:05,324 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-02-06 04:43:05,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2020067601, now seen corresponding path program 2 times [2025-02-06 04:43:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281899822] [2025-02-06 04:43:05,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:05,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:43:05,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-02-06 04:43:05,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:43:05,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281899822] [2025-02-06 04:43:05,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281899822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:05,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:05,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:43:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919393036] [2025-02-06 04:43:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:05,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:43:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:05,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:43:05,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:43:05,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:43:05,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:05,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:05,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:43:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:05,880 INFO L124 PetriNetUnfolderBase]: 2101/3784 cut-off events. [2025-02-06 04:43:05,880 INFO L125 PetriNetUnfolderBase]: For 2129/2196 co-relation queries the response was YES. [2025-02-06 04:43:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9222 conditions, 3784 events. 2101/3784 cut-off events. For 2129/2196 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22940 event pairs, 486 based on Foata normal form. 2/3628 useless extension candidates. Maximal degree in co-relation 9207. Up to 1897 conditions per place. [2025-02-06 04:43:05,900 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 72 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2025-02-06 04:43:05,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 515 flow [2025-02-06 04:43:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:43:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:43:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-06 04:43:05,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 04:43:05,901 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 223 flow. Second operand 6 states and 136 transitions. [2025-02-06 04:43:05,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 515 flow [2025-02-06 04:43:05,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 492 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:05,907 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 250 flow [2025-02-06 04:43:05,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-02-06 04:43:05,909 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2025-02-06 04:43:05,909 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 250 flow [2025-02-06 04:43:05,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:05,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:05,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:05,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:43:05,910 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-02-06 04:43:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1343730971, now seen corresponding path program 1 times [2025-02-06 04:43:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646347650] [2025-02-06 04:43:05,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:05,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:43:05,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:43:05,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:05,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:43:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646347650] [2025-02-06 04:43:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646347650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832126088] [2025-02-06 04:43:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:06,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:06,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:06,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:43:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:43:06,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:43:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:06,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:43:06,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:06,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:43:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832126088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:43:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-06 04:43:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162519343] [2025-02-06 04:43:06,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:06,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:06,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:43:06,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:06,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-02-06 04:43:06,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:06,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:06,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:06,613 INFO L124 PetriNetUnfolderBase]: 2423/5060 cut-off events. [2025-02-06 04:43:06,614 INFO L125 PetriNetUnfolderBase]: For 4604/4852 co-relation queries the response was YES. [2025-02-06 04:43:06,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 5060 events. 2423/5060 cut-off events. For 4604/4852 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 37032 event pairs, 724 based on Foata normal form. 183/5181 useless extension candidates. Maximal degree in co-relation 12630. Up to 1323 conditions per place. [2025-02-06 04:43:06,639 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 74 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-02-06 04:43:06,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 541 flow [2025-02-06 04:43:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-06 04:43:06,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2025-02-06 04:43:06,641 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 250 flow. Second operand 4 states and 116 transitions. [2025-02-06 04:43:06,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 541 flow [2025-02-06 04:43:06,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:06,647 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 296 flow [2025-02-06 04:43:06,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-02-06 04:43:06,648 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-02-06 04:43:06,649 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 296 flow [2025-02-06 04:43:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-02-06 04:43:06,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:06,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-02-06 04:43:06,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:43:06,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:06,850 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-02-06 04:43:06,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 821493576, now seen corresponding path program 1 times [2025-02-06 04:43:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091222952] [2025-02-06 04:43:06,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:06,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:43:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:43:06,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:43:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091222952] [2025-02-06 04:43:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091222952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414429955] [2025-02-06 04:43:06,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:06,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:06,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:43:07,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:43:07,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:43:07,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:07,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:07,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:43:07,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:43:07,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:43:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414429955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:43:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-06 04:43:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359936608] [2025-02-06 04:43:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:07,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:07,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:43:07,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:07,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:07,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:07,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:07,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:07,559 INFO L124 PetriNetUnfolderBase]: 3757/7186 cut-off events. [2025-02-06 04:43:07,559 INFO L125 PetriNetUnfolderBase]: For 10451/11044 co-relation queries the response was YES. [2025-02-06 04:43:07,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19897 conditions, 7186 events. 3757/7186 cut-off events. For 10451/11044 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 52096 event pairs, 1115 based on Foata normal form. 348/7372 useless extension candidates. Maximal degree in co-relation 19879. Up to 1972 conditions per place. [2025-02-06 04:43:07,593 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 81 selfloop transitions, 8 changer transitions 7/109 dead transitions. [2025-02-06 04:43:07,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 109 transitions, 680 flow [2025-02-06 04:43:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-02-06 04:43:07,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2025-02-06 04:43:07,595 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 296 flow. Second operand 4 states and 122 transitions. [2025-02-06 04:43:07,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 109 transitions, 680 flow [2025-02-06 04:43:07,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 668 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-06 04:43:07,601 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 289 flow [2025-02-06 04:43:07,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2025-02-06 04:43:07,601 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2025-02-06 04:43:07,601 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 289 flow [2025-02-06 04:43:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:07,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:07,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2025-02-06 04:43:07,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:43:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:07,802 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-02-06 04:43:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1499515946, now seen corresponding path program 1 times [2025-02-06 04:43:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904024462] [2025-02-06 04:43:07,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:07,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:43:07,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:43:07,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:07,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904024462] [2025-02-06 04:43:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904024462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159772978] [2025-02-06 04:43:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:07,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:07,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:43:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:43:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:43:08,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:08,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:43:08,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:08,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159772978] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:08,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:43:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429857673] [2025-02-06 04:43:08,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:43:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:08,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:43:08,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:43:08,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:43:08,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 289 flow. Second operand has 12 states, 12 states have (on average 17.333333333333332) internal successors, (208), 12 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:08,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:08,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:43:08,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:08,796 INFO L124 PetriNetUnfolderBase]: 4258/8801 cut-off events. [2025-02-06 04:43:08,796 INFO L125 PetriNetUnfolderBase]: For 16737/17038 co-relation queries the response was YES. [2025-02-06 04:43:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25550 conditions, 8801 events. 4258/8801 cut-off events. For 16737/17038 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 69469 event pairs, 2864 based on Foata normal form. 200/8843 useless extension candidates. Maximal degree in co-relation 25529. Up to 4848 conditions per place. [2025-02-06 04:43:08,837 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 42 selfloop transitions, 3 changer transitions 44/102 dead transitions. [2025-02-06 04:43:08,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 705 flow [2025-02-06 04:43:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:43:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:43:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-02-06 04:43:08,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-02-06 04:43:08,839 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 289 flow. Second operand 6 states and 140 transitions. [2025-02-06 04:43:08,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 705 flow [2025-02-06 04:43:08,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 669 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-02-06 04:43:08,851 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 293 flow [2025-02-06 04:43:08,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=67, 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=6, PETRI_FLOW=293, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2025-02-06 04:43:08,852 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2025-02-06 04:43:08,852 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 293 flow [2025-02-06 04:43:08,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.333333333333332) internal successors, (208), 12 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:08,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:08,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2025-02-06 04:43:08,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:43:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 04:43:09,057 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-02-06 04:43:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1292747963, now seen corresponding path program 2 times [2025-02-06 04:43:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803743514] [2025-02-06 04:43:09,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:09,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:09,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:09,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:09,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:10,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:10,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803743514] [2025-02-06 04:43:10,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803743514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:10,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759947525] [2025-02-06 04:43:10,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:43:10,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:10,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:10,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:10,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:43:10,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:10,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:10,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:10,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 04:43:10,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:10,325 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 24 treesize of output 8 [2025-02-06 04:43:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:43:10,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:10,517 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:43:10,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 04:43:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:43:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759947525] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:10,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 32 [2025-02-06 04:43:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029234041] [2025-02-06 04:43:10,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 04:43:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:10,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 04:43:10,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 04:43:10,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:43:10,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 293 flow. Second operand has 33 states, 33 states have (on average 11.818181818181818) internal successors, (390), 33 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:10,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:10,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:43:10,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:17,327 INFO L124 PetriNetUnfolderBase]: 37458/60563 cut-off events. [2025-02-06 04:43:17,328 INFO L125 PetriNetUnfolderBase]: For 92048/92048 co-relation queries the response was YES. [2025-02-06 04:43:17,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170594 conditions, 60563 events. 37458/60563 cut-off events. For 92048/92048 co-relation queries the response was YES. Maximal size of possible extension queue 2359. Compared 497155 event pairs, 2071 based on Foata normal form. 1012/57490 useless extension candidates. Maximal degree in co-relation 170572. Up to 7113 conditions per place. [2025-02-06 04:43:17,690 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 685 selfloop transitions, 100 changer transitions 36/829 dead transitions. [2025-02-06 04:43:17,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 829 transitions, 5489 flow [2025-02-06 04:43:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-06 04:43:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-02-06 04:43:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1196 transitions. [2025-02-06 04:43:17,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4768740031897927 [2025-02-06 04:43:17,693 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 293 flow. Second operand 57 states and 1196 transitions. [2025-02-06 04:43:17,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 829 transitions, 5489 flow [2025-02-06 04:43:17,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 829 transitions, 5435 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-02-06 04:43:17,759 INFO L231 Difference]: Finished difference. Result has 156 places, 157 transitions, 1295 flow [2025-02-06 04:43:17,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1295, PETRI_PLACES=156, PETRI_TRANSITIONS=157} [2025-02-06 04:43:17,759 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2025-02-06 04:43:17,759 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 157 transitions, 1295 flow [2025-02-06 04:43:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 11.818181818181818) internal successors, (390), 33 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:17,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:17,760 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2025-02-06 04:43:17,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:43:17,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:43:17,960 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-02-06 04:43:17,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1548222055, now seen corresponding path program 3 times [2025-02-06 04:43:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289085773] [2025-02-06 04:43:17,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:43:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:17,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:17,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:17,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:43:17,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289085773] [2025-02-06 04:43:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289085773] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053014217] [2025-02-06 04:43:18,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:43:18,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:18,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:43:18,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:18,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:18,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:43:18,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:18,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 04:43:18,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:18,718 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 23 treesize of output 7 [2025-02-06 04:43:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:18,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:18,893 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:43:18,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 04:43:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:43:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053014217] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:19,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-06 04:43:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951747170] [2025-02-06 04:43:19,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:19,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:43:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:19,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:43:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:43:19,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:43:19,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 157 transitions, 1295 flow. Second operand has 27 states, 27 states have (on average 12.185185185185185) internal successors, (329), 27 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:19,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:19,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:43:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:33,931 INFO L124 PetriNetUnfolderBase]: 70690/117812 cut-off events. [2025-02-06 04:43:33,931 INFO L125 PetriNetUnfolderBase]: For 731968/731968 co-relation queries the response was YES. [2025-02-06 04:43:34,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451495 conditions, 117812 events. 70690/117812 cut-off events. For 731968/731968 co-relation queries the response was YES. Maximal size of possible extension queue 3677. Compared 1045639 event pairs, 4993 based on Foata normal form. 1499/118449 useless extension candidates. Maximal degree in co-relation 451445. Up to 14426 conditions per place. [2025-02-06 04:43:35,094 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 790 selfloop transitions, 279 changer transitions 22/1099 dead transitions. [2025-02-06 04:43:35,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1099 transitions, 10026 flow [2025-02-06 04:43:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-06 04:43:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-02-06 04:43:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1110 transitions. [2025-02-06 04:43:35,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48513986013986016 [2025-02-06 04:43:35,097 INFO L175 Difference]: Start difference. First operand has 156 places, 157 transitions, 1295 flow. Second operand 52 states and 1110 transitions. [2025-02-06 04:43:35,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1099 transitions, 10026 flow [2025-02-06 04:43:40,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1099 transitions, 9570 flow, removed 216 selfloop flow, removed 10 redundant places. [2025-02-06 04:43:40,743 INFO L231 Difference]: Finished difference. Result has 214 places, 418 transitions, 5177 flow [2025-02-06 04:43:40,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=5177, PETRI_PLACES=214, PETRI_TRANSITIONS=418} [2025-02-06 04:43:40,744 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places. [2025-02-06 04:43:40,744 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 418 transitions, 5177 flow [2025-02-06 04:43:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.185185185185185) internal successors, (329), 27 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:40,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:40,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2025-02-06 04:43:40,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 04:43:40,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 04:43:40,946 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-02-06 04:43:40,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 404100589, now seen corresponding path program 4 times [2025-02-06 04:43:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:40,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862832450] [2025-02-06 04:43:40,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:43:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:40,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:40,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:40,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:43:40,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:43:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862832450] [2025-02-06 04:43:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862832450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629529887] [2025-02-06 04:43:41,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:43:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:41,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:41,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:41,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:43:41,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-02-06 04:43:41,494 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:43:41,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:43:41,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:41,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 04:43:41,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:41,917 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-06 04:43:41,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-02-06 04:43:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:43:41,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:42,302 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-02-06 04:43:42,303 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 45 treesize of output 82 [2025-02-06 04:43:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:43:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629529887] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:42,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-02-06 04:43:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857551654] [2025-02-06 04:43:42,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 04:43:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:42,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 04:43:42,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-02-06 04:43:42,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-02-06 04:43:42,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 418 transitions, 5177 flow. Second operand has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 31 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-02-06 04:43:42,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:42,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-02-06 04:43:42,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand