./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.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-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:43:54,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:43:54,557 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:43:54,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:43:54,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:43:54,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:43:54,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:43:54,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:43:54,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:43:54,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:43:54,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:43:54,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:43:54,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:43:54,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:43:54,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:43:54,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:43:54,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:54,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:43:54,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:43:54,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:43:54,590 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-02-06 04:43:54,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:43:54,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:43:54,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:43:54,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:43:54,851 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:43:54,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-06 04:43:55,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1977d1435/e6debea535ab420fa53ea84a5a72ff85/FLAGcdac3891b [2025-02-06 04:43:56,224 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:43:56,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-06 04:43:56,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1977d1435/e6debea535ab420fa53ea84a5a72ff85/FLAGcdac3891b [2025-02-06 04:43:56,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1977d1435/e6debea535ab420fa53ea84a5a72ff85 [2025-02-06 04:43:56,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:43:56,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:43:56,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:56,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:43:56,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:43:56,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:56" (1/1) ... [2025-02-06 04:43:56,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbe7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:56, skipping insertion in model container [2025-02-06 04:43:56,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:43:56" (1/1) ... [2025-02-06 04:43:56,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:43:56,425 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-two-queue.wvr.c[3013,3026] [2025-02-06 04:43:56,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:56,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:43:56,461 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-two-queue.wvr.c[3013,3026] [2025-02-06 04:43:56,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:43:56,474 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:43:56,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:56 WrapperNode [2025-02-06 04:43:56,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:43:56,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:56,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:43:56,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:43:56,479 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:56" (1/1) ... [2025-02-06 04:43:56,484 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:56" (1/1) ... [2025-02-06 04:43:56,497 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 186 [2025-02-06 04:43:56,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:43:56,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:43:56,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:43:56,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:43:56,506 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:56" (1/1) ... [2025-02-06 04:43:56,506 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:56" (1/1) ... [2025-02-06 04:43:56,508 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:56" (1/1) ... [2025-02-06 04:43:56,517 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:56,517 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:56" (1/1) ... [2025-02-06 04:43:56,517 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:56" (1/1) ... [2025-02-06 04:43:56,521 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:56" (1/1) ... [2025-02-06 04:43:56,521 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:56" (1/1) ... [2025-02-06 04:43:56,522 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:56" (1/1) ... [2025-02-06 04:43:56,523 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:56" (1/1) ... [2025-02-06 04:43:56,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:43:56,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:43:56,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:43:56,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:43:56,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:56" (1/1) ... [2025-02-06 04:43:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:43:56,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:56,548 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:56,550 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:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:43:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:43:56,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:43:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:43:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:43:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:43:56,567 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:56,673 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:43:56,674 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:43:56,913 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:43:56,913 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:43:57,191 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:43:57,192 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:43:57,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:57 BoogieIcfgContainer [2025-02-06 04:43:57,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:43:57,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:43:57,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:43:57,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:43:57,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:43:56" (1/3) ... [2025-02-06 04:43:57,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1742b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:57, skipping insertion in model container [2025-02-06 04:43:57,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:43:56" (2/3) ... [2025-02-06 04:43:57,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1742b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:43:57, skipping insertion in model container [2025-02-06 04:43:57,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:43:57" (3/3) ... [2025-02-06 04:43:57,201 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-02-06 04:43:57,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:43:57,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:43:57,214 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:43:57,273 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:43:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-02-06 04:43:57,325 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-06 04:43:57,328 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:43:57,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-06 04:43:57,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-02-06 04:43:57,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-02-06 04:43:57,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:43:57,351 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;@3158790e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:43:57,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:43:57,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:43:57,364 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-02-06 04:43:57,364 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:43:57,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:57,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:57,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 768563539, now seen corresponding path program 1 times [2025-02-06 04:43:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:57,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137687311] [2025-02-06 04:43:57,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:57,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:57,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:43:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:43:57,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:57,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:57,640 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:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137687311] [2025-02-06 04:43:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137687311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922541535] [2025-02-06 04:43:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:57,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:57,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:57,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:57,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-06 04:43:57,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:57,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:57,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-06 04:43:57,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:57,768 INFO L124 PetriNetUnfolderBase]: 141/263 cut-off events. [2025-02-06 04:43:57,768 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 04:43:57,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 263 events. 141/263 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1060 event pairs, 26 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 458. Up to 181 conditions per place. [2025-02-06 04:43:57,772 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2025-02-06 04:43:57,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 155 flow [2025-02-06 04:43:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-02-06 04:43:57,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-02-06 04:43:57,782 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 3 states and 53 transitions. [2025-02-06 04:43:57,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 155 flow [2025-02-06 04:43:57,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:43:57,787 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 73 flow [2025-02-06 04:43:57,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-02-06 04:43:57,791 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2025-02-06 04:43:57,791 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 73 flow [2025-02-06 04:43:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:57,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:57,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:43:57,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:57,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 23169152, now seen corresponding path program 1 times [2025-02-06 04:43:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484364233] [2025-02-06 04:43:57,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:57,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:43:57,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:43:57,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:57,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:57,904 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:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484364233] [2025-02-06 04:43:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484364233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602018677] [2025-02-06 04:43:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:57,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:57,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:57,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:57,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-06 04:43:57,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:57,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:57,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-06 04:43:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:58,026 INFO L124 PetriNetUnfolderBase]: 105/206 cut-off events. [2025-02-06 04:43:58,026 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 04:43:58,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 206 events. 105/206 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 732 event pairs, 22 based on Foata normal form. 6/202 useless extension candidates. Maximal degree in co-relation 120. Up to 143 conditions per place. [2025-02-06 04:43:58,030 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2025-02-06 04:43:58,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 147 flow [2025-02-06 04:43:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-06 04:43:58,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:43:58,031 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 73 flow. Second operand 3 states and 49 transitions. [2025-02-06 04:43:58,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 147 flow [2025-02-06 04:43:58,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:58,032 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2025-02-06 04:43:58,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-02-06 04:43:58,033 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-02-06 04:43:58,033 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 82 flow [2025-02-06 04:43:58,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:58,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:58,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:43:58,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:58,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 178142070, now seen corresponding path program 1 times [2025-02-06 04:43:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320144403] [2025-02-06 04:43:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:43:58,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:43:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:58,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320144403] [2025-02-06 04:43:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320144403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:58,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:43:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386213632] [2025-02-06 04:43:58,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:43:58,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:58,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:43:58,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:43:58,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-06 04:43:58,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-06 04:43:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:58,176 INFO L124 PetriNetUnfolderBase]: 80/166 cut-off events. [2025-02-06 04:43:58,177 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 04:43:58,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 166 events. 80/166 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 489 event pairs, 27 based on Foata normal form. 5/163 useless extension candidates. Maximal degree in co-relation 246. Up to 112 conditions per place. [2025-02-06 04:43:58,180 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2025-02-06 04:43:58,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 170 flow [2025-02-06 04:43:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:43:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:43:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-02-06 04:43:58,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-02-06 04:43:58,181 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 82 flow. Second operand 3 states and 51 transitions. [2025-02-06 04:43:58,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 170 flow [2025-02-06 04:43:58,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:58,183 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 92 flow [2025-02-06 04:43:58,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-02-06 04:43:58,184 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-02-06 04:43:58,185 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 92 flow [2025-02-06 04:43:58,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:58,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:58,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:43:58,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:58,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1380778259, now seen corresponding path program 1 times [2025-02-06 04:43:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80506142] [2025-02-06 04:43:58,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:58,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:43:58,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:43:58,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:58,350 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:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80506142] [2025-02-06 04:43:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80506142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:43:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805458546] [2025-02-06 04:43:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:58,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:58,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:58,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:58,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-06 04:43:58,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:58,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-06 04:43:58,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:58,441 INFO L124 PetriNetUnfolderBase]: 95/216 cut-off events. [2025-02-06 04:43:58,442 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-06 04:43:58,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 216 events. 95/216 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 821 event pairs, 67 based on Foata normal form. 3/207 useless extension candidates. Maximal degree in co-relation 266. Up to 150 conditions per place. [2025-02-06 04:43:58,444 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 23 selfloop transitions, 2 changer transitions 12/42 dead transitions. [2025-02-06 04:43:58,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 199 flow [2025-02-06 04:43:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-02-06 04:43:58,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-02-06 04:43:58,447 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 92 flow. Second operand 4 states and 62 transitions. [2025-02-06 04:43:58,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 199 flow [2025-02-06 04:43:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:43:58,448 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 104 flow [2025-02-06 04:43:58,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-02-06 04:43:58,450 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-02-06 04:43:58,450 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 104 flow [2025-02-06 04:43:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:58,450 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:58,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:43:58,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -225535420, now seen corresponding path program 1 times [2025-02-06 04:43:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970327628] [2025-02-06 04:43:58,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:43:58,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:58,579 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:58,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970327628] [2025-02-06 04:43:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970327628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:43:58,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:43:58,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:43:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44358864] [2025-02-06 04:43:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:43:58,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:43:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:58,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:43:58,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:43:58,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-06 04:43:58,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:58,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-06 04:43:58,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:43:58,633 INFO L124 PetriNetUnfolderBase]: 93/211 cut-off events. [2025-02-06 04:43:58,633 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-02-06 04:43:58,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 211 events. 93/211 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 772 event pairs, 66 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 476. Up to 151 conditions per place. [2025-02-06 04:43:58,634 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 24 selfloop transitions, 2 changer transitions 10/41 dead transitions. [2025-02-06 04:43:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 206 flow [2025-02-06 04:43:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:43:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:43:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-06 04:43:58,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-02-06 04:43:58,635 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 104 flow. Second operand 4 states and 60 transitions. [2025-02-06 04:43:58,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 206 flow [2025-02-06 04:43:58,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:58,636 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 112 flow [2025-02-06 04:43:58,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-02-06 04:43:58,637 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-02-06 04:43:58,637 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 112 flow [2025-02-06 04:43:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:58,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:58,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:58,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:43:58,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:43:58,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash -317948351, now seen corresponding path program 1 times [2025-02-06 04:43:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098981512] [2025-02-06 04:43:58,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:58,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:43:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:43:58,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:58,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098981512] [2025-02-06 04:43:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098981512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188665053] [2025-02-06 04:43:59,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:43:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:59,898 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:59,899 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:59,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:43:59,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:43:59,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:43:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:59,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 04:43:59,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:00,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 04:44:00,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 04:44:00,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:44:00,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 04:44:00,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 04:44:00,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-02-06 04:44:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:00,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:06,089 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-02-06 04:44:06,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 298 [2025-02-06 04:44:06,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:44:06,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 223 [2025-02-06 04:44:06,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 14 [2025-02-06 04:44:06,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:44:06,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 285 [2025-02-06 04:44:07,386 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-02-06 04:44:07,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 733 treesize of output 643 [2025-02-06 04:44:07,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:44:07,417 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 429 treesize of output 415 [2025-02-06 04:44:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 32 [2025-02-06 04:44:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 32 [2025-02-06 04:44:07,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:44:07,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 241 [2025-02-06 04:44:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188665053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:09,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-02-06 04:44:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633573993] [2025-02-06 04:44:09,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:09,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 04:44:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:09,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 04:44:09,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1495, Unknown=1, NotChecked=0, Total=1640 [2025-02-06 04:44:09,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:09,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 112 flow. Second operand has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:44:09,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:09,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:09,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:14,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:44:51,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:45:08,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:45:19,160 INFO L124 PetriNetUnfolderBase]: 577/1091 cut-off events. [2025-02-06 04:45:19,160 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2025-02-06 04:45:19,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 1091 events. 577/1091 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5354 event pairs, 37 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 1744. Up to 198 conditions per place. [2025-02-06 04:45:19,165 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 139 selfloop transitions, 126 changer transitions 42/310 dead transitions. [2025-02-06 04:45:19,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 310 transitions, 1558 flow [2025-02-06 04:45:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-06 04:45:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-02-06 04:45:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 604 transitions. [2025-02-06 04:45:19,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36561743341404357 [2025-02-06 04:45:19,170 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 112 flow. Second operand 59 states and 604 transitions. [2025-02-06 04:45:19,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 310 transitions, 1558 flow [2025-02-06 04:45:19,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 310 transitions, 1526 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:19,181 INFO L231 Difference]: Finished difference. Result has 113 places, 163 transitions, 1046 flow [2025-02-06 04:45:19,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=1046, PETRI_PLACES=113, PETRI_TRANSITIONS=163} [2025-02-06 04:45:19,182 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 85 predicate places. [2025-02-06 04:45:19,182 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 163 transitions, 1046 flow [2025-02-06 04:45:19,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:45:19,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:19,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:19,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:19,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:19,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash -96043553, now seen corresponding path program 2 times [2025-02-06 04:45:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62177037] [2025-02-06 04:45:19,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:19,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:45:19,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-06 04:45:19,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:45:19,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:20,707 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:45:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62177037] [2025-02-06 04:45:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62177037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:45:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730297014] [2025-02-06 04:45:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:45:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:20,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:45:20,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:45:20,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:45:20,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 163 transitions, 1046 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:45:20,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:20,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:45:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:22,768 INFO L124 PetriNetUnfolderBase]: 652/1210 cut-off events. [2025-02-06 04:45:22,768 INFO L125 PetriNetUnfolderBase]: For 7542/7542 co-relation queries the response was YES. [2025-02-06 04:45:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 1210 events. 652/1210 cut-off events. For 7542/7542 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5951 event pairs, 94 based on Foata normal form. 1/1184 useless extension candidates. Maximal degree in co-relation 4173. Up to 707 conditions per place. [2025-02-06 04:45:22,781 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 151 selfloop transitions, 59 changer transitions 8/221 dead transitions. [2025-02-06 04:45:22,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 221 transitions, 1908 flow [2025-02-06 04:45:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:45:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:45:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-02-06 04:45:22,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2025-02-06 04:45:22,783 INFO L175 Difference]: Start difference. First operand has 113 places, 163 transitions, 1046 flow. Second operand 11 states and 135 transitions. [2025-02-06 04:45:22,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 221 transitions, 1908 flow [2025-02-06 04:45:22,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 221 transitions, 1746 flow, removed 79 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:22,811 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 1257 flow [2025-02-06 04:45:22,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1257, PETRI_PLACES=122, PETRI_TRANSITIONS=184} [2025-02-06 04:45:22,812 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 94 predicate places. [2025-02-06 04:45:22,812 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 1257 flow [2025-02-06 04:45:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:45:22,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:22,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:22,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:45:22,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 979667603, now seen corresponding path program 3 times [2025-02-06 04:45:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280083560] [2025-02-06 04:45:22,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:45:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:22,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:45:22,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-06 04:45:22,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:45:22,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:24,248 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:45:24,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:24,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280083560] [2025-02-06 04:45:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280083560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:24,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:24,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:45:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019562077] [2025-02-06 04:45:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:24,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:45:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:24,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:45:24,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:45:24,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:45:24,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 184 transitions, 1257 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:45:24,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:24,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:45:24,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:26,165 INFO L124 PetriNetUnfolderBase]: 728/1339 cut-off events. [2025-02-06 04:45:26,165 INFO L125 PetriNetUnfolderBase]: For 9773/9773 co-relation queries the response was YES. [2025-02-06 04:45:26,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6682 conditions, 1339 events. 728/1339 cut-off events. For 9773/9773 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6738 event pairs, 83 based on Foata normal form. 1/1313 useless extension candidates. Maximal degree in co-relation 6418. Up to 851 conditions per place. [2025-02-06 04:45:26,181 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 166 selfloop transitions, 62 changer transitions 8/239 dead transitions. [2025-02-06 04:45:26,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 239 transitions, 2154 flow [2025-02-06 04:45:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:45:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:45:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-02-06 04:45:26,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2025-02-06 04:45:26,183 INFO L175 Difference]: Start difference. First operand has 122 places, 184 transitions, 1257 flow. Second operand 11 states and 135 transitions. [2025-02-06 04:45:26,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 239 transitions, 2154 flow [2025-02-06 04:45:26,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 239 transitions, 2112 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:26,218 INFO L231 Difference]: Finished difference. Result has 135 places, 202 transitions, 1582 flow [2025-02-06 04:45:26,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1582, PETRI_PLACES=135, PETRI_TRANSITIONS=202} [2025-02-06 04:45:26,220 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 107 predicate places. [2025-02-06 04:45:26,220 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 202 transitions, 1582 flow [2025-02-06 04:45:26,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:45:26,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:26,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:45:26,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1042349825, now seen corresponding path program 4 times [2025-02-06 04:45:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:26,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504280331] [2025-02-06 04:45:26,222 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:45:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:26,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:45:26,244 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:45:26,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:45:26,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504280331] [2025-02-06 04:45:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504280331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994164195] [2025-02-06 04:45:31,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:45:31,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:31,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:31,306 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:45:31,307 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:45:31,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:45:31,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:45:31,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:45:31,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:31,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 04:45:31,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:31,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 04:45:34,415 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-06 04:45:34,415 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 52 treesize of output 20 [2025-02-06 04:45:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:45:34,994 INFO L312 TraceCheckSpWp]: Computing backward predicates...