./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-proofs-counter-add-4-semi-Q67.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 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:47:38,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:47:38,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:47:38,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:47:38,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:47:38,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:47:38,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:47:38,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:47:38,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:47:38,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:47:38,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:47:38,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:47:38,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:47:38,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:47:38,624 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:47:38,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:47:38,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:47:38,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:38,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:38,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:38,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:47:38,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:47:38,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:47:38,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:47:38,628 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 -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2025-01-09 16:47:38,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:47:38,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:47:38,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:47:38,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:47:38,859 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:47:38,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-01-09 16:47:39,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54dbe4847/eb308031e5cf4399994efa0ebac285dd/FLAGaf80be2e9 [2025-01-09 16:47:40,192 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:47:40,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-01-09 16:47:40,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54dbe4847/eb308031e5cf4399994efa0ebac285dd/FLAGaf80be2e9 [2025-01-09 16:47:40,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54dbe4847/eb308031e5cf4399994efa0ebac285dd [2025-01-09 16:47:40,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:47:40,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:47:40,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:40,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:47:40,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:47:40,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40, skipping insertion in model container [2025-01-09 16:47:40,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:47:40,365 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-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-01-09 16:47:40,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:40,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:47:40,395 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-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-01-09 16:47:40,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:40,412 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:47:40,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40 WrapperNode [2025-01-09 16:47:40,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:40,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:40,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:47:40,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:47:40,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,441 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-01-09 16:47:40,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:40,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:47:40,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:47:40,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:47:40,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:47:40,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:47:40,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:47:40,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:47:40,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:47:40,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (1/1) ... [2025-01-09 16:47:40,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:40,515 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-01-09 16:47:40,517 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-01-09 16:47:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:47:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:47:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:47:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:47:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:47:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:47:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:47:40,535 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:47:40,602 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:47:40,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:47:40,735 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:47:40,736 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:47:40,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:47:40,854 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:47:40,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:40 BoogieIcfgContainer [2025-01-09 16:47:40,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:47:40,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:47:40,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:47:40,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:47:40,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:47:40" (1/3) ... [2025-01-09 16:47:40,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2427355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:40, skipping insertion in model container [2025-01-09 16:47:40,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:40" (2/3) ... [2025-01-09 16:47:40,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2427355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:40, skipping insertion in model container [2025-01-09 16:47:40,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:40" (3/3) ... [2025-01-09 16:47:40,862 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-01-09 16:47:40,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:47:40,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c that has 5 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:47:40,873 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:47:40,911 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:47:40,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 100 flow [2025-01-09 16:47:40,958 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-01-09 16:47:40,960 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:47:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-09 16:47:40,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 36 transitions, 100 flow [2025-01-09 16:47:40,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-01-09 16:47:40,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:47:40,980 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;@7de7bd7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:47:40,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:47:40,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:47:40,990 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-09 16:47:40,990 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:47:40,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:40,991 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-01-09 16:47:40,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1892404497, now seen corresponding path program 1 times [2025-01-09 16:47:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:41,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292912330] [2025-01-09 16:47:41,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:47:41,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:47:41,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:41,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292912330] [2025-01-09 16:47:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292912330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:41,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:47:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472607530] [2025-01-09 16:47:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:41,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:47:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:47:41,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:47:41,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-01-09 16:47:41,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:41,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:41,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-01-09 16:47:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:41,551 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2025-01-09 16:47:41,552 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-09 16:47:41,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7290 event pairs, 182 based on Foata normal form. 44/1726 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2025-01-09 16:47:41,564 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2025-01-09 16:47:41,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2025-01-09 16:47:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:47:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:47:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-01-09 16:47:41,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 16:47:41,578 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 81 transitions. [2025-01-09 16:47:41,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2025-01-09 16:47:41,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:41,588 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2025-01-09 16:47:41,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-01-09 16:47:41,593 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-01-09 16:47:41,594 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2025-01-09 16:47:41,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:41,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:41,595 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-01-09 16:47:41,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:47:41,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:41,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1928545399, now seen corresponding path program 1 times [2025-01-09 16:47:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193700913] [2025-01-09 16:47:41,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:41,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:41,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:41,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193700913] [2025-01-09 16:47:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193700913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:41,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:47:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147867730] [2025-01-09 16:47:41,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:47:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:41,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:47:41,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:47:41,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:47:41,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:41,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:41,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:47:41,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:42,150 INFO L124 PetriNetUnfolderBase]: 1990/2821 cut-off events. [2025-01-09 16:47:42,150 INFO L125 PetriNetUnfolderBase]: For 694/740 co-relation queries the response was YES. [2025-01-09 16:47:42,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 2821 events. 1990/2821 cut-off events. For 694/740 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13044 event pairs, 331 based on Foata normal form. 8/2644 useless extension candidates. Maximal degree in co-relation 1262. Up to 1664 conditions per place. [2025-01-09 16:47:42,167 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-01-09 16:47:42,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2025-01-09 16:47:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-09 16:47:42,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-01-09 16:47:42,170 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 134 transitions. [2025-01-09 16:47:42,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2025-01-09 16:47:42,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:47:42,173 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2025-01-09 16:47:42,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2025-01-09 16:47:42,174 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-01-09 16:47:42,175 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2025-01-09 16:47:42,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:42,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:42,175 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-01-09 16:47:42,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:47:42,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:42,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1787622063, now seen corresponding path program 2 times [2025-01-09 16:47:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988193504] [2025-01-09 16:47:42,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:42,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:42,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:42,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:42,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988193504] [2025-01-09 16:47:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988193504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97351900] [2025-01-09 16:47:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:42,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:42,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:42,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:42,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:42,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:42,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:42,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:42,619 INFO L124 PetriNetUnfolderBase]: 2737/3837 cut-off events. [2025-01-09 16:47:42,619 INFO L125 PetriNetUnfolderBase]: For 2899/2899 co-relation queries the response was YES. [2025-01-09 16:47:42,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 3837 events. 2737/3837 cut-off events. For 2899/2899 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18485 event pairs, 520 based on Foata normal form. 12/3547 useless extension candidates. Maximal degree in co-relation 2225. Up to 3206 conditions per place. [2025-01-09 16:47:42,647 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 58 selfloop transitions, 6 changer transitions 2/73 dead transitions. [2025-01-09 16:47:42,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 73 transitions, 387 flow [2025-01-09 16:47:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-09 16:47:42,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-01-09 16:47:42,649 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 102 transitions. [2025-01-09 16:47:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 73 transitions, 387 flow [2025-01-09 16:47:42,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 387 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:42,653 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 191 flow [2025-01-09 16:47:42,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-09 16:47:42,654 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-01-09 16:47:42,655 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 191 flow [2025-01-09 16:47:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:42,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:42,655 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-01-09 16:47:42,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:47:42,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 223445073, now seen corresponding path program 1 times [2025-01-09 16:47:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-01-09 16:47:42,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:42,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:42,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:42,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-01-09 16:47:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927020686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807394889] [2025-01-09 16:47:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:42,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:42,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:42,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:42,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:47:42,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:42,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:42,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:47:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:42,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [38#L97-4true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#L64true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 50#(= ~counter~0 0), 37#L41true, 61#true, 67#true, 3#thread2EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true]) [2025-01-09 16:47:42,916 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2025-01-09 16:47:42,916 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-01-09 16:47:42,916 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2025-01-09 16:47:42,916 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-01-09 16:47:42,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 8#L64true, Black: 50#(= ~counter~0 0), 33#L98-3true, 37#L41true, 61#true, 3#thread2EXITtrue, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true]) [2025-01-09 16:47:42,944 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2025-01-09 16:47:42,944 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-01-09 16:47:42,944 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:47:42,944 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:47:42,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 30#$Ultimate##0true, 8#L64true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 37#L41true, 3#thread2EXITtrue, 52#true, 10#L98-4true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:42,970 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2025-01-09 16:47:42,970 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-01-09 16:47:42,970 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:42,970 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:42,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [30#$Ultimate##0true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 8#L64true, 37#L41true, 3#thread2EXITtrue, 52#true, 4#L99true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:42,997 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-01-09 16:47:42,997 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:42,997 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:42,997 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:47:43,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#L64true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 37#L41true, 3#thread2EXITtrue, 52#true, 10#L98-4true, Black: 50#(= ~counter~0 0), 61#true, 67#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,050 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-01-09 16:47:43,050 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:43,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:43,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:43,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][28], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 9#L56true, 37#L41true, 52#true, 10#L98-4true, 34#L79true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,068 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,068 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,068 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,068 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:43,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#L64true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 37#L41true, 3#thread2EXITtrue, 52#true, 4#L99true, Black: 50#(= ~counter~0 0), 61#true, 67#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,070 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#L64true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 37#L41true, 3#thread2EXITtrue, 52#true, 10#L98-4true, 34#L79true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,070 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,070 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,071 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:43,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][28], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 37#L41true, 52#true, 10#L98-4true, 34#L79true, 27#L67true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,074 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,074 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:43,074 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,074 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:43,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][45], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 8#L64true, 37#L41true, 3#thread2EXITtrue, 52#true, 34#L79true, 4#L99true, Black: 50#(= ~counter~0 0), 61#true, 67#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:43,083 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,084 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,084 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:43,085 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:43,104 INFO L124 PetriNetUnfolderBase]: 2741/3824 cut-off events. [2025-01-09 16:47:43,105 INFO L125 PetriNetUnfolderBase]: For 4497/4537 co-relation queries the response was YES. [2025-01-09 16:47:43,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11918 conditions, 3824 events. 2741/3824 cut-off events. For 4497/4537 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 18519 event pairs, 610 based on Foata normal form. 22/3761 useless extension candidates. Maximal degree in co-relation 2648. Up to 2984 conditions per place. [2025-01-09 16:47:43,127 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 58 selfloop transitions, 7 changer transitions 14/88 dead transitions. [2025-01-09 16:47:43,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 528 flow [2025-01-09 16:47:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-09 16:47:43,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-01-09 16:47:43,128 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 191 flow. Second operand 5 states and 128 transitions. [2025-01-09 16:47:43,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 528 flow [2025-01-09 16:47:43,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:43,131 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 233 flow [2025-01-09 16:47:43,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-01-09 16:47:43,131 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-01-09 16:47:43,131 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 233 flow [2025-01-09 16:47:43,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:43,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:43,135 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-01-09 16:47:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:47:43,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:43,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash -335533999, now seen corresponding path program 3 times [2025-01-09 16:47:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-01-09 16:47:43,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:43,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:47:43,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:43,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:47:43,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:43,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-01-09 16:47:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863024214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:43,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104289350] [2025-01-09 16:47:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:43,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:43,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:43,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:43,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:47:43,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:43,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:43,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:47:43,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:43,556 INFO L124 PetriNetUnfolderBase]: 3092/4334 cut-off events. [2025-01-09 16:47:43,556 INFO L125 PetriNetUnfolderBase]: For 6683/6780 co-relation queries the response was YES. [2025-01-09 16:47:43,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14189 conditions, 4334 events. 3092/4334 cut-off events. For 6683/6780 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 20981 event pairs, 769 based on Foata normal form. 33/4252 useless extension candidates. Maximal degree in co-relation 6462. Up to 2700 conditions per place. [2025-01-09 16:47:43,577 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 77 selfloop transitions, 20 changer transitions 1/107 dead transitions. [2025-01-09 16:47:43,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 753 flow [2025-01-09 16:47:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-09 16:47:43,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-01-09 16:47:43,578 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 233 flow. Second operand 5 states and 128 transitions. [2025-01-09 16:47:43,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 753 flow [2025-01-09 16:47:43,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 107 transitions, 738 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:43,582 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 415 flow [2025-01-09 16:47:43,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2025-01-09 16:47:43,583 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-01-09 16:47:43,583 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 415 flow [2025-01-09 16:47:43,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:43,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:43,583 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-01-09 16:47:43,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:47:43,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1845880119, now seen corresponding path program 4 times [2025-01-09 16:47:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745917318] [2025-01-09 16:47:43,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:43,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:47:43,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:43,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745917318] [2025-01-09 16:47:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745917318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:43,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484714977] [2025-01-09 16:47:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:43,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:43,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:43,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:43,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:43,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:43,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:43,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:43,986 INFO L124 PetriNetUnfolderBase]: 4173/5786 cut-off events. [2025-01-09 16:47:43,986 INFO L125 PetriNetUnfolderBase]: For 13116/13116 co-relation queries the response was YES. [2025-01-09 16:47:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21422 conditions, 5786 events. 4173/5786 cut-off events. For 13116/13116 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 29511 event pairs, 729 based on Foata normal form. 84/5865 useless extension candidates. Maximal degree in co-relation 5636. Up to 2660 conditions per place. [2025-01-09 16:47:44,015 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 101 selfloop transitions, 11 changer transitions 10/129 dead transitions. [2025-01-09 16:47:44,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 129 transitions, 1080 flow [2025-01-09 16:47:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-09 16:47:44,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-09 16:47:44,017 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 415 flow. Second operand 5 states and 126 transitions. [2025-01-09 16:47:44,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 129 transitions, 1080 flow [2025-01-09 16:47:44,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 129 transitions, 1080 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:44,021 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 524 flow [2025-01-09 16:47:44,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2025-01-09 16:47:44,024 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-01-09 16:47:44,024 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 524 flow [2025-01-09 16:47:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:44,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:44,025 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-01-09 16:47:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:47:44,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:44,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1590484361, now seen corresponding path program 5 times [2025-01-09 16:47:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451477322] [2025-01-09 16:47:44,025 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:44,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:44,036 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:44,040 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:44,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451477322] [2025-01-09 16:47:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451477322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:44,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:44,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958656738] [2025-01-09 16:47:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:44,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:44,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:44,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:44,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:47:44,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:44,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:44,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:47:44,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:44,397 INFO L124 PetriNetUnfolderBase]: 3269/4614 cut-off events. [2025-01-09 16:47:44,397 INFO L125 PetriNetUnfolderBase]: For 15403/15611 co-relation queries the response was YES. [2025-01-09 16:47:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19225 conditions, 4614 events. 3269/4614 cut-off events. For 15403/15611 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 22844 event pairs, 932 based on Foata normal form. 24/4547 useless extension candidates. Maximal degree in co-relation 7227. Up to 4151 conditions per place. [2025-01-09 16:47:44,429 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 55 selfloop transitions, 6 changer transitions 16/87 dead transitions. [2025-01-09 16:47:44,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 758 flow [2025-01-09 16:47:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-09 16:47:44,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2025-01-09 16:47:44,430 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 524 flow. Second operand 4 states and 95 transitions. [2025-01-09 16:47:44,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 758 flow [2025-01-09 16:47:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 721 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-01-09 16:47:44,438 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 450 flow [2025-01-09 16:47:44,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-01-09 16:47:44,439 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2025-01-09 16:47:44,439 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 450 flow [2025-01-09 16:47:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:44,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:44,439 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-01-09 16:47:44,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:47:44,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:44,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -709953497, now seen corresponding path program 2 times [2025-01-09 16:47:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110830403] [2025-01-09 16:47:44,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:44,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:44,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:44,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:44,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110830403] [2025-01-09 16:47:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110830403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:44,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:44,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231123716] [2025-01-09 16:47:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:44,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:44,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:47:44,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:44,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:44,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:47:44,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:44,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 9#L56true, 99#true, 83#true, 33#L98-3true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,694 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,694 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:47:44,694 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-01-09 16:47:44,694 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, 30#$Ultimate##0true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 9#L56true, 83#true, 37#L41true, 99#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,721 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 24#thread3EXITtrue, 9#L56true, 99#true, 83#true, 33#L98-3true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,721 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:44,721 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-01-09 16:47:44,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, 30#$Ultimate##0true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 83#true, 99#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,752 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, 30#$Ultimate##0true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 24#thread3EXITtrue, 99#true, 83#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,752 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,752 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][74], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 83#true, 37#L41true, 99#true, 32#$Ultimate##0true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 34#L79true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,759 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,759 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,759 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,759 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:47:44,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 83#true, 99#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,779 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,779 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, 30#$Ultimate##0true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 9#L56true, 24#thread3EXITtrue, 83#true, 99#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,780 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,780 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,780 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,780 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][68], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 8#L64true, 37#L41true, 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 3#thread2EXITtrue, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 34#L79true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 83#true, Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,781 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,781 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][74], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 83#true, 99#true, 37#L41true, 3#thread2EXITtrue, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 34#L79true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 4#L99true, Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,782 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,782 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][74], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 24#thread3EXITtrue, 83#true, 37#L41true, 99#true, 32#$Ultimate##0true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 34#L79true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,786 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,786 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:44,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 9#L56true, 83#true, 37#L41true, 99#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 4#L99true, Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,846 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,846 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,846 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,846 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 24#thread3EXITtrue, 9#L56true, 99#true, 83#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,847 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][74], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 83#true, 99#true, 37#L41true, 3#thread2EXITtrue, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 34#L79true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,847 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:44,847 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][52], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 97#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, Black: 64#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 24#thread3EXITtrue, 83#true, 99#true, 37#L41true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 4#L99true, Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 92#true]) [2025-01-09 16:47:44,861 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:47:44,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,861 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:44,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:44,874 INFO L124 PetriNetUnfolderBase]: 3864/5397 cut-off events. [2025-01-09 16:47:44,874 INFO L125 PetriNetUnfolderBase]: For 15398/15424 co-relation queries the response was YES. [2025-01-09 16:47:44,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21576 conditions, 5397 events. 3864/5397 cut-off events. For 15398/15424 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 27630 event pairs, 792 based on Foata normal form. 42/5302 useless extension candidates. Maximal degree in co-relation 11725. Up to 4623 conditions per place. [2025-01-09 16:47:44,901 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 72 selfloop transitions, 8 changer transitions 2/91 dead transitions. [2025-01-09 16:47:44,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 772 flow [2025-01-09 16:47:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-01-09 16:47:44,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2025-01-09 16:47:44,902 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 450 flow. Second operand 4 states and 98 transitions. [2025-01-09 16:47:44,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 772 flow [2025-01-09 16:47:44,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 739 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-09 16:47:44,909 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 502 flow [2025-01-09 16:47:44,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2025-01-09 16:47:44,910 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-01-09 16:47:44,910 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 502 flow [2025-01-09 16:47:44,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:44,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:44,910 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-01-09 16:47:44,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:47:44,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -846518801, now seen corresponding path program 3 times [2025-01-09 16:47:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017578555] [2025-01-09 16:47:44,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:44,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:47:44,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:44,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:47:44,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017578555] [2025-01-09 16:47:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017578555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609818218] [2025-01-09 16:47:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:44,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:44,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:45,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:45,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:45,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:45,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:45,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:45,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, 37#L41true, 99#true, 83#true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 25#L75true, 27#L67true, Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,305 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, 99#true, 83#true, 37#L41true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,305 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:47:45,305 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, 99#true, 83#true, 37#L41true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, 27#L67true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 25#L75true, Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,334 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, 37#L41true, 99#true, 83#true, 107#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 27#L67true, 4#L99true, Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,334 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#L56true, 24#thread3EXITtrue, 37#L41true, 99#true, 83#true, 107#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 25#L75true, Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,334 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,334 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 9#L56true, 99#true, 83#true, 37#L41true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,335 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,335 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 9#L56true, 99#true, 83#true, 37#L41true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 4#L99true, Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 25#L75true, Black: 50#(= ~counter~0 0), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,355 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][63], [75#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 9#L56true, 37#L41true, 99#true, 83#true, 107#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 104#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 4#L99true, Black: 50#(= ~counter~0 0), 31#thread4EXITtrue, Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:45,355 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:45,355 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:45,374 INFO L124 PetriNetUnfolderBase]: 5508/7513 cut-off events. [2025-01-09 16:47:45,375 INFO L125 PetriNetUnfolderBase]: For 26534/26550 co-relation queries the response was YES. [2025-01-09 16:47:45,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31879 conditions, 7513 events. 5508/7513 cut-off events. For 26534/26550 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 38243 event pairs, 1392 based on Foata normal form. 30/7330 useless extension candidates. Maximal degree in co-relation 12581. Up to 6409 conditions per place. [2025-01-09 16:47:45,414 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 83 selfloop transitions, 10 changer transitions 4/105 dead transitions. [2025-01-09 16:47:45,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 961 flow [2025-01-09 16:47:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-09 16:47:45,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-01-09 16:47:45,419 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 502 flow. Second operand 4 states and 94 transitions. [2025-01-09 16:47:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 961 flow [2025-01-09 16:47:45,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:45,431 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 612 flow [2025-01-09 16:47:45,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=612, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2025-01-09 16:47:45,433 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2025-01-09 16:47:45,433 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 612 flow [2025-01-09 16:47:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:45,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:45,434 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-01-09 16:47:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:47:45,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 422838819, now seen corresponding path program 4 times [2025-01-09 16:47:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900882945] [2025-01-09 16:47:45,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:45,442 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:47:45,447 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:45,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900882945] [2025-01-09 16:47:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900882945] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:45,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115564331] [2025-01-09 16:47:45,496 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:45,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:45,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:45,500 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-01-09 16:47:45,501 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-01-09 16:47:45,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:47:45,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:47:45,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:45,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:45,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:47:45,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:45,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115564331] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:47:45,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-01-09 16:47:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080383986] [2025-01-09 16:47:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:45,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:45,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:45,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:47:45,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:45,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 612 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:45,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:45,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:46,038 INFO L124 PetriNetUnfolderBase]: 3355/4538 cut-off events. [2025-01-09 16:47:46,038 INFO L125 PetriNetUnfolderBase]: For 21127/21328 co-relation queries the response was YES. [2025-01-09 16:47:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21914 conditions, 4538 events. 3355/4538 cut-off events. For 21127/21328 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 21961 event pairs, 510 based on Foata normal form. 164/4687 useless extension candidates. Maximal degree in co-relation 10724. Up to 2289 conditions per place. [2025-01-09 16:47:46,061 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 82 selfloop transitions, 20 changer transitions 2/112 dead transitions. [2025-01-09 16:47:46,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 1039 flow [2025-01-09 16:47:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-01-09 16:47:46,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2025-01-09 16:47:46,063 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 612 flow. Second operand 4 states and 103 transitions. [2025-01-09 16:47:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 1039 flow [2025-01-09 16:47:46,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 1024 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:47:46,073 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 617 flow [2025-01-09 16:47:46,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2025-01-09 16:47:46,075 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2025-01-09 16:47:46,075 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 617 flow [2025-01-09 16:47:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:46,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:46,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:47:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:47:46,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1254970957, now seen corresponding path program 1 times [2025-01-09 16:47:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585900346] [2025-01-09 16:47:46,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:46,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:46,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:46,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585900346] [2025-01-09 16:47:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585900346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:47:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765112835] [2025-01-09 16:47:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:46,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:46,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:46,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:46,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:46,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:46,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:46,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:46,725 INFO L124 PetriNetUnfolderBase]: 3492/4815 cut-off events. [2025-01-09 16:47:46,725 INFO L125 PetriNetUnfolderBase]: For 26791/27477 co-relation queries the response was YES. [2025-01-09 16:47:46,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23735 conditions, 4815 events. 3492/4815 cut-off events. For 26791/27477 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 23315 event pairs, 439 based on Foata normal form. 411/5109 useless extension candidates. Maximal degree in co-relation 13166. Up to 2790 conditions per place. [2025-01-09 16:47:46,768 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 85 selfloop transitions, 12 changer transitions 4/113 dead transitions. [2025-01-09 16:47:46,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 1043 flow [2025-01-09 16:47:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-01-09 16:47:46,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-01-09 16:47:46,770 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 617 flow. Second operand 5 states and 125 transitions. [2025-01-09 16:47:46,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 1043 flow [2025-01-09 16:47:46,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 1043 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:46,786 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 561 flow [2025-01-09 16:47:46,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-01-09 16:47:46,788 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2025-01-09 16:47:46,789 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 561 flow [2025-01-09 16:47:46,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:46,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:46,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:47:46,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:46,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1329471335, now seen corresponding path program 1 times [2025-01-09 16:47:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:46,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456671678] [2025-01-09 16:47:46,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:46,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:47:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:46,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:46,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:46,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456671678] [2025-01-09 16:47:46,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456671678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:46,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:47:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939550089] [2025-01-09 16:47:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:46,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:46,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:46,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:46,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:46,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:46,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:47,391 INFO L124 PetriNetUnfolderBase]: 4169/5615 cut-off events. [2025-01-09 16:47:47,391 INFO L125 PetriNetUnfolderBase]: For 39329/39608 co-relation queries the response was YES. [2025-01-09 16:47:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30856 conditions, 5615 events. 4169/5615 cut-off events. For 39329/39608 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 25202 event pairs, 477 based on Foata normal form. 314/5787 useless extension candidates. Maximal degree in co-relation 15261. Up to 2922 conditions per place. [2025-01-09 16:47:47,429 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 87 selfloop transitions, 13 changer transitions 1/113 dead transitions. [2025-01-09 16:47:47,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 1124 flow [2025-01-09 16:47:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-01-09 16:47:47,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-09 16:47:47,430 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 561 flow. Second operand 5 states and 123 transitions. [2025-01-09 16:47:47,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 1124 flow [2025-01-09 16:47:47,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 1087 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:47,447 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 608 flow [2025-01-09 16:47:47,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-09 16:47:47,449 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-01-09 16:47:47,450 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 608 flow [2025-01-09 16:47:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:47,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:47,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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:47,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:47:47,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1457867345, now seen corresponding path program 1 times [2025-01-09 16:47:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228736770] [2025-01-09 16:47:47,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:47:47,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:47,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228736770] [2025-01-09 16:47:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228736770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784488468] [2025-01-09 16:47:47,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:47,529 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-01-09 16:47:47,530 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-01-09 16:47:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:47:47,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:47,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:47,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:47,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:47,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784488468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:47,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2025-01-09 16:47:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842167906] [2025-01-09 16:47:47,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:47,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:47,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-01-09 16:47:47,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:47,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:47,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-01-09 16:47:47,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:48,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][81], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, 274#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 99#true, 37#L41true, 83#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 27#L67true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:48,197 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:47:48,197 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:48,197 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:48,197 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:47:48,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][81], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 274#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 37#L41true, 99#true, 83#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 10#L98-4true, Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:48,215 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:47:48,215 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:48,215 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:48,215 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:48,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][81], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 274#true, Black: 113#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 83#true, 37#L41true, 99#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 27#L67true, 4#L99true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:48,220 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:47:48,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:48,220 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:48,220 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:48,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][81], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, 274#true, Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 99#true, 83#true, 37#L41true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 4#L99true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:48,229 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:47:48,229 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:48,229 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:48,229 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:47:48,245 INFO L124 PetriNetUnfolderBase]: 6813/10022 cut-off events. [2025-01-09 16:47:48,245 INFO L125 PetriNetUnfolderBase]: For 83877/86427 co-relation queries the response was YES. [2025-01-09 16:47:48,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55887 conditions, 10022 events. 6813/10022 cut-off events. For 83877/86427 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 59799 event pairs, 1256 based on Foata normal form. 1065/10647 useless extension candidates. Maximal degree in co-relation 26674. Up to 4512 conditions per place. [2025-01-09 16:47:48,319 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 69 selfloop transitions, 27 changer transitions 2/124 dead transitions. [2025-01-09 16:47:48,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 1277 flow [2025-01-09 16:47:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-09 16:47:48,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-01-09 16:47:48,320 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 608 flow. Second operand 4 states and 114 transitions. [2025-01-09 16:47:48,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 1277 flow [2025-01-09 16:47:48,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 1249 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:48,349 INFO L231 Difference]: Finished difference. Result has 76 places, 89 transitions, 1029 flow [2025-01-09 16:47:48,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1029, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2025-01-09 16:47:48,349 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2025-01-09 16:47:48,349 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 89 transitions, 1029 flow [2025-01-09 16:47:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:48,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:48,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:48,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:48,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:48,550 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -890568107, now seen corresponding path program 2 times [2025-01-09 16:47:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106320545] [2025-01-09 16:47:48,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:48,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:48,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:48,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:48,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106320545] [2025-01-09 16:47:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106320545] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760322394] [2025-01-09 16:47:48,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:48,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:48,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:48,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:48,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:47:48,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:48,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:48,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:48,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:48,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:48,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:48,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:47:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760322394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:47:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-09 16:47:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115878055] [2025-01-09 16:47:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:48,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:48,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:48,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:47:48,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-01-09 16:47:48,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 89 transitions, 1029 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:48,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:48,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-01-09 16:47:48,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:49,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][113], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 470#true, 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 83#true, Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 8#L64true, 99#true, 37#L41true, 3#thread2EXITtrue, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, 10#L98-4true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 34#L79true, 116#(<= (+ ~i1~0 1) ~N1~0), Black: 50#(= ~counter~0 0), 282#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,835 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:47:49,835 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:49,835 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:49,835 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:47:49,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~j2~0_45 1) v_~j2~0_44) (= (+ v_~counter~0_127 1) v_~counter~0_128)) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_45} OutVars{~counter~0=v_~counter~0_127, ~j2~0=v_~j2~0_44, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_1|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_#t~post7#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~j2~0, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][113], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 470#true, 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 83#true, Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 8#L64true, 99#true, 37#L41true, 3#thread2EXITtrue, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 34#L79true, 116#(<= (+ ~i1~0 1) ~N1~0), 4#L99true, Black: 50#(= ~counter~0 0), 282#true, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,905 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:47:49,905 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:49,905 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:49,905 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:49,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][116], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 470#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 113#true, Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 99#true, 83#true, 37#L41true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 10#L98-4true, Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 27#L67true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,946 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:47:49,946 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:47:49,946 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:49,946 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:47:49,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][116], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 470#true, Black: 113#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 37#L41true, 83#true, 99#true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 10#L98-4true, Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,978 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:47:49,978 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:49,978 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:49,978 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:47:49,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][116], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 470#true, Black: 113#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 99#true, 83#true, 37#L41true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 27#L67true, 4#L99true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,980 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:47:49,980 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:49,980 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:47:49,980 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:47:49,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0)) (= v_~i2~0_54 (+ v_~i2~0_55 1))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_121, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_54, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork1_#t~post3#1][116], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#thread3EXITtrue, 470#true, Black: 113#true, Black: 69#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 268#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 270#(and (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= 1 ~N1~0) (= ~M1~0 ~N2~0)), Black: 77#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 80#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), Black: 284#(= ~counter~0 0), Black: 285#(= ~counter~0 1), Black: 278#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~N1~0) (= ~M2~0 ~M1~0)), Black: 276#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 88#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0)), Black: 86#(<= (+ ~j1~0 1) ~M1~0), 75#true, 9#L56true, 83#true, 99#true, 37#L41true, Black: 101#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 52#true, Black: 110#(and (= ~j2~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), Black: 109#(and (= ~j2~0 0) (= ~j1~0 0) (= ~M2~0 ~M1~0)), 116#(<= (+ ~i1~0 1) ~N1~0), 4#L99true, Black: 50#(= ~counter~0 0), 282#true, 31#thread4EXITtrue, Black: 58#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2025-01-09 16:47:49,999 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-09 16:47:49,999 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:47:49,999 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:47:49,999 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:47:50,020 INFO L124 PetriNetUnfolderBase]: 13393/19668 cut-off events. [2025-01-09 16:47:50,020 INFO L125 PetriNetUnfolderBase]: For 232165/238814 co-relation queries the response was YES. [2025-01-09 16:47:50,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123044 conditions, 19668 events. 13393/19668 cut-off events. For 232165/238814 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 130006 event pairs, 2059 based on Foata normal form. 1769/20630 useless extension candidates. Maximal degree in co-relation 56123. Up to 8878 conditions per place. [2025-01-09 16:47:50,278 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 87 selfloop transitions, 66 changer transitions 2/181 dead transitions. [2025-01-09 16:47:50,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 181 transitions, 2181 flow [2025-01-09 16:47:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-01-09 16:47:50,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-01-09 16:47:50,279 INFO L175 Difference]: Start difference. First operand has 76 places, 89 transitions, 1029 flow. Second operand 5 states and 147 transitions. [2025-01-09 16:47:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 181 transitions, 2181 flow [2025-01-09 16:47:50,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 181 transitions, 2147 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:50,336 INFO L231 Difference]: Finished difference. Result has 82 places, 128 transitions, 1805 flow [2025-01-09 16:47:50,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1805, PETRI_PLACES=82, PETRI_TRANSITIONS=128} [2025-01-09 16:47:50,337 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2025-01-09 16:47:50,337 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 128 transitions, 1805 flow [2025-01-09 16:47:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:50,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:50,337 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:50,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:47:50,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:50,537 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 786543173, now seen corresponding path program 3 times [2025-01-09 16:47:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:50,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776979181] [2025-01-09 16:47:50,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:50,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:47:50,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-01-09 16:47:50,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:47:50,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:50,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776979181] [2025-01-09 16:47:50,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776979181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:50,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:50,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:47:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579572771] [2025-01-09 16:47:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:47:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:47:50,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:47:50,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:50,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 128 transitions, 1805 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:50,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:50,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:50,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:53,701 INFO L124 PetriNetUnfolderBase]: 23601/32893 cut-off events. [2025-01-09 16:47:53,702 INFO L125 PetriNetUnfolderBase]: For 362545/363592 co-relation queries the response was YES. [2025-01-09 16:47:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210839 conditions, 32893 events. 23601/32893 cut-off events. For 362545/363592 co-relation queries the response was YES. Maximal size of possible extension queue 1744. Compared 208460 event pairs, 3120 based on Foata normal form. 1409/33577 useless extension candidates. Maximal degree in co-relation 69166. Up to 9667 conditions per place. [2025-01-09 16:47:53,937 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 267 selfloop transitions, 41 changer transitions 0/320 dead transitions. [2025-01-09 16:47:53,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 320 transitions, 4907 flow [2025-01-09 16:47:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2025-01-09 16:47:53,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6865079365079365 [2025-01-09 16:47:53,938 INFO L175 Difference]: Start difference. First operand has 82 places, 128 transitions, 1805 flow. Second operand 7 states and 173 transitions. [2025-01-09 16:47:53,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 320 transitions, 4907 flow [2025-01-09 16:47:54,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 320 transitions, 4625 flow, removed 141 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:54,138 INFO L231 Difference]: Finished difference. Result has 91 places, 136 transitions, 1941 flow [2025-01-09 16:47:54,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1941, PETRI_PLACES=91, PETRI_TRANSITIONS=136} [2025-01-09 16:47:54,138 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2025-01-09 16:47:54,139 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 136 transitions, 1941 flow [2025-01-09 16:47:54,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:54,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:54,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:47:54,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:47:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash -831969267, now seen corresponding path program 4 times [2025-01-09 16:47:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980135884] [2025-01-09 16:47:54,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:54,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:47:54,147 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:47:54,148 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:54,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980135884] [2025-01-09 16:47:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980135884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:47:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707353140] [2025-01-09 16:47:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:54,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:54,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:54,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:47:54,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 136 transitions, 1941 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:54,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:54,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:47:54,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:59,499 INFO L124 PetriNetUnfolderBase]: 43089/60992 cut-off events. [2025-01-09 16:47:59,499 INFO L125 PetriNetUnfolderBase]: For 848631/852188 co-relation queries the response was YES. [2025-01-09 16:47:59,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406878 conditions, 60992 events. 43089/60992 cut-off events. For 848631/852188 co-relation queries the response was YES. Maximal size of possible extension queue 3058. Compared 426788 event pairs, 6401 based on Foata normal form. 1050/61570 useless extension candidates. Maximal degree in co-relation 193358. Up to 16187 conditions per place. [2025-01-09 16:47:59,978 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 316 selfloop transitions, 94 changer transitions 9/431 dead transitions. [2025-01-09 16:47:59,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 431 transitions, 6965 flow [2025-01-09 16:47:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:47:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:47:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-01-09 16:47:59,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-09 16:47:59,979 INFO L175 Difference]: Start difference. First operand has 91 places, 136 transitions, 1941 flow. Second operand 8 states and 207 transitions. [2025-01-09 16:47:59,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 431 transitions, 6965 flow [2025-01-09 16:48:00,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 431 transitions, 6737 flow, removed 55 selfloop flow, removed 3 redundant places. [2025-01-09 16:48:00,464 INFO L231 Difference]: Finished difference. Result has 101 places, 217 transitions, 3542 flow [2025-01-09 16:48:00,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3542, PETRI_PLACES=101, PETRI_TRANSITIONS=217} [2025-01-09 16:48:00,464 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 61 predicate places. [2025-01-09 16:48:00,464 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 217 transitions, 3542 flow [2025-01-09 16:48:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:00,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:00,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:48:00,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:48:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 54286719, now seen corresponding path program 5 times [2025-01-09 16:48:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467484996] [2025-01-09 16:48:00,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:00,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:48:00,472 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:48:00,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:00,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467484996] [2025-01-09 16:48:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467484996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309521336] [2025-01-09 16:48:00,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:00,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:00,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:00,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:48:00,558 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:48:00,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:48:00,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:00,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:48:00,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:00,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309521336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:00,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 16:48:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113318772] [2025-01-09 16:48:00,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:00,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:48:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:00,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:48:00,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:48:00,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:48:00,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 217 transitions, 3542 flow. Second operand has 13 states, 13 states have (on average 15.153846153846153) internal successors, (197), 13 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:00,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:00,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:48:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:16,925 INFO L124 PetriNetUnfolderBase]: 114007/160555 cut-off events. [2025-01-09 16:48:16,925 INFO L125 PetriNetUnfolderBase]: For 2552463/2571321 co-relation queries the response was YES. [2025-01-09 16:48:17,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118164 conditions, 160555 events. 114007/160555 cut-off events. For 2552463/2571321 co-relation queries the response was YES. Maximal size of possible extension queue 6884. Compared 1217999 event pairs, 7239 based on Foata normal form. 4879/162750 useless extension candidates. Maximal degree in co-relation 571147. Up to 41293 conditions per place. [2025-01-09 16:48:18,679 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 1179 selfloop transitions, 256 changer transitions 9/1459 dead transitions. [2025-01-09 16:48:18,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 1459 transitions, 26071 flow [2025-01-09 16:48:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:48:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:48:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 438 transitions. [2025-01-09 16:48:18,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-01-09 16:48:18,681 INFO L175 Difference]: Start difference. First operand has 101 places, 217 transitions, 3542 flow. Second operand 17 states and 438 transitions. [2025-01-09 16:48:18,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 1459 transitions, 26071 flow [2025-01-09 16:48:26,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 1459 transitions, 24897 flow, removed 587 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:26,906 INFO L231 Difference]: Finished difference. Result has 126 places, 462 transitions, 8503 flow [2025-01-09 16:48:26,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8503, PETRI_PLACES=126, PETRI_TRANSITIONS=462} [2025-01-09 16:48:26,907 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2025-01-09 16:48:26,907 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 462 transitions, 8503 flow [2025-01-09 16:48:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.153846153846153) internal successors, (197), 13 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:26,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:26,907 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:26,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:48:27,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 16:48:27,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:48:27,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1734829151, now seen corresponding path program 6 times [2025-01-09 16:48:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702341217] [2025-01-09 16:48:27,108 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:48:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:27,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:48:27,116 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-01-09 16:48:27,116 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:48:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:48:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:27,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702341217] [2025-01-09 16:48:27,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702341217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:27,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:27,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:48:27,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256298778] [2025-01-09 16:48:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:48:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:27,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:48:27,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:48:27,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-01-09 16:48:27,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 462 transitions, 8503 flow. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:27,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:27,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-01-09 16:48:27,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand