./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-hard1.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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:44:27,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:44:27,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:44:27,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:44:27,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:44:27,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:44:27,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:44:27,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:44:27,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:44:27,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:44:27,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:44:27,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:44:27,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:44:27,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:44:27,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:44:27,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:44:27,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:44:27,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:44:27,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:44:27,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:44:27,150 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2025-02-06 04:44:27,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:44:27,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:44:27,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:44:27,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:44:27,367 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:44:27,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-02-06 04:44:28,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a703bc153/fbb6295bdef741c39c6ff1659dfcbd15/FLAGaffdc19bd [2025-02-06 04:44:28,702 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:44:28,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-02-06 04:44:28,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a703bc153/fbb6295bdef741c39c6ff1659dfcbd15/FLAGaffdc19bd [2025-02-06 04:44:28,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a703bc153/fbb6295bdef741c39c6ff1659dfcbd15 [2025-02-06 04:44:28,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:44:28,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:44:28,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:44:28,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:44:28,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:44:28,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28, skipping insertion in model container [2025-02-06 04:44:28,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:44:28,910 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/test-hard1.wvr.c[3425,3438] [2025-02-06 04:44:28,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:44:28,924 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:44:28,947 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/test-hard1.wvr.c[3425,3438] [2025-02-06 04:44:28,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:44:28,959 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:44:28,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28 WrapperNode [2025-02-06 04:44:28,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:44:28,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:44:28,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:44:28,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:44:28,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,985 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-02-06 04:44:28,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:44:28,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:44:28,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:44:28,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:44:28,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:28,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,014 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-02-06 04:44:29,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:44:29,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:44:29,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:44:29,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:44:29,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (1/1) ... [2025-02-06 04:44:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:44:29,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:29,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:44:29,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:44:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:44:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:44:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:44:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:44:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:44:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:44:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:44:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 04:44:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 04:44:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:44:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:44:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:44:29,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:44:29,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:44:29,073 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:44:29,148 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:44:29,149 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:44:29,315 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:44:29,316 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:44:29,455 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:44:29,456 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:44:29,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:44:29 BoogieIcfgContainer [2025-02-06 04:44:29,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:44:29,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:44:29,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:44:29,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:44:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:44:28" (1/3) ... [2025-02-06 04:44:29,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2e9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:44:29, skipping insertion in model container [2025-02-06 04:44:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:28" (2/3) ... [2025-02-06 04:44:29,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2e9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:44:29, skipping insertion in model container [2025-02-06 04:44:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:44:29" (3/3) ... [2025-02-06 04:44:29,462 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-02-06 04:44:29,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:44:29,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 41 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:44:29,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:44:29,514 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 04:44:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 116 flow [2025-02-06 04:44:29,562 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-06 04:44:29,563 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:44:29,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 40 events. 4/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-06 04:44:29,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 44 transitions, 116 flow [2025-02-06 04:44:29,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 102 flow [2025-02-06 04:44:29,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:44:29,590 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;@306f37c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:44:29,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:44:29,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:44:29,601 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-02-06 04:44:29,601 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:44:29,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:29,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:29,602 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-02-06 04:44:29,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash -546620567, now seen corresponding path program 1 times [2025-02-06 04:44:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206407807] [2025-02-06 04:44:29,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:44:29,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:44:29,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206407807] [2025-02-06 04:44:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206407807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:44:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878221737] [2025-02-06 04:44:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:29,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:44:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:30,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:44:30,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:44:30,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-02-06 04:44:30,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:30,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:30,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-02-06 04:44:30,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:30,477 INFO L124 PetriNetUnfolderBase]: 3331/4541 cut-off events. [2025-02-06 04:44:30,478 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-02-06 04:44:30,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 4541 events. 3331/4541 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20650 event pairs, 587 based on Foata normal form. 1/4475 useless extension candidates. Maximal degree in co-relation 8234. Up to 3534 conditions per place. [2025-02-06 04:44:30,503 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2025-02-06 04:44:30,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 275 flow [2025-02-06 04:44:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:44:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:44:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 04:44:30,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2025-02-06 04:44:30,512 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 102 flow. Second operand 3 states and 93 transitions. [2025-02-06 04:44:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 275 flow [2025-02-06 04:44:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:44:30,523 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 119 flow [2025-02-06 04:44:30,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-02-06 04:44:30,526 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-02-06 04:44:30,526 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 119 flow [2025-02-06 04:44:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:30,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:30,526 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] [2025-02-06 04:44:30,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:44:30,527 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-02-06 04:44:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1015643843, now seen corresponding path program 1 times [2025-02-06 04:44:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460728276] [2025-02-06 04:44:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:30,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:44:30,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:30,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:30,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460728276] [2025-02-06 04:44:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460728276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:30,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:30,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:44:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934227331] [2025-02-06 04:44:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:30,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:44:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:30,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:44:30,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:44:30,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-06 04:44:30,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:30,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:30,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-06 04:44:30,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:31,697 INFO L124 PetriNetUnfolderBase]: 7323/10064 cut-off events. [2025-02-06 04:44:31,697 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-02-06 04:44:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22908 conditions, 10064 events. 7323/10064 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 55135 event pairs, 1628 based on Foata normal form. 0/9517 useless extension candidates. Maximal degree in co-relation 6147. Up to 3843 conditions per place. [2025-02-06 04:44:31,751 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 120 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2025-02-06 04:44:31,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 145 transitions, 691 flow [2025-02-06 04:44:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:44:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:44:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2025-02-06 04:44:31,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-02-06 04:44:31,753 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 119 flow. Second operand 6 states and 192 transitions. [2025-02-06 04:44:31,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 145 transitions, 691 flow [2025-02-06 04:44:31,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 145 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:44:31,757 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 260 flow [2025-02-06 04:44:31,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-02-06 04:44:31,758 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2025-02-06 04:44:31,758 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 260 flow [2025-02-06 04:44:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:31,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:31,758 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] [2025-02-06 04:44:31,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:44:31,759 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-02-06 04:44:31,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1352787651, now seen corresponding path program 2 times [2025-02-06 04:44:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219043969] [2025-02-06 04:44:31,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:31,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:44:31,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:31,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:44:31,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219043969] [2025-02-06 04:44:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219043969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:44:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97351900] [2025-02-06 04:44:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:44:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:32,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:44:32,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:44:32,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-06 04:44:32,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:32,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:32,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-06 04:44:32,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:33,287 INFO L124 PetriNetUnfolderBase]: 13441/18620 cut-off events. [2025-02-06 04:44:33,287 INFO L125 PetriNetUnfolderBase]: For 19166/19166 co-relation queries the response was YES. [2025-02-06 04:44:33,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54303 conditions, 18620 events. 13441/18620 cut-off events. For 19166/19166 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 106643 event pairs, 672 based on Foata normal form. 580/19178 useless extension candidates. Maximal degree in co-relation 29825. Up to 8673 conditions per place. [2025-02-06 04:44:33,398 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 187 selfloop transitions, 32 changer transitions 1/228 dead transitions. [2025-02-06 04:44:33,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 228 transitions, 1444 flow [2025-02-06 04:44:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:44:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:44:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2025-02-06 04:44:33,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792929292929293 [2025-02-06 04:44:33,403 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 260 flow. Second operand 9 states and 269 transitions. [2025-02-06 04:44:33,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 228 transitions, 1444 flow [2025-02-06 04:44:33,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 228 transitions, 1444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:33,460 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 516 flow [2025-02-06 04:44:33,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=516, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2025-02-06 04:44:33,460 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-02-06 04:44:33,460 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 516 flow [2025-02-06 04:44:33,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:33,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:33,461 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] [2025-02-06 04:44:33,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:44:33,461 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-02-06 04:44:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1938885437, now seen corresponding path program 3 times [2025-02-06 04:44:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449846860] [2025-02-06 04:44:33,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:44:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:33,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:44:33,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:33,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:44:33,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449846860] [2025-02-06 04:44:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449846860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:33,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:33,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:44:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415943752] [2025-02-06 04:44:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:33,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:44:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:33,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:44:33,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:44:33,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-06 04:44:33,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 516 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:33,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:33,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-06 04:44:33,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:35,725 INFO L124 PetriNetUnfolderBase]: 22614/31558 cut-off events. [2025-02-06 04:44:35,725 INFO L125 PetriNetUnfolderBase]: For 66931/66969 co-relation queries the response was YES. [2025-02-06 04:44:35,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111979 conditions, 31558 events. 22614/31558 cut-off events. For 66931/66969 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 196424 event pairs, 2684 based on Foata normal form. 220/31727 useless extension candidates. Maximal degree in co-relation 64802. Up to 13681 conditions per place. [2025-02-06 04:44:35,964 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 257 selfloop transitions, 63 changer transitions 0/328 dead transitions. [2025-02-06 04:44:35,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 328 transitions, 2584 flow [2025-02-06 04:44:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:44:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:44:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2025-02-06 04:44:35,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2025-02-06 04:44:35,970 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 516 flow. Second operand 10 states and 298 transitions. [2025-02-06 04:44:35,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 328 transitions, 2584 flow [2025-02-06 04:44:36,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 328 transitions, 2491 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:44:36,233 INFO L231 Difference]: Finished difference. Result has 82 places, 129 transitions, 1139 flow [2025-02-06 04:44:36,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1139, PETRI_PLACES=82, PETRI_TRANSITIONS=129} [2025-02-06 04:44:36,234 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 34 predicate places. [2025-02-06 04:44:36,234 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 129 transitions, 1139 flow [2025-02-06 04:44:36,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:36,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:36,234 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] [2025-02-06 04:44:36,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:44:36,234 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-02-06 04:44:36,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1362130685, now seen corresponding path program 1 times [2025-02-06 04:44:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-06 04:44:36,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:36,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:44:36,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:36,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:36,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:36,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:36,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-06 04:44:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050576505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:36,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:44:36,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048671794] [2025-02-06 04:44:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:36,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:44:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:36,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:44:36,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:44:36,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-02-06 04:44:36,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 129 transitions, 1139 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:36,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:36,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-02-06 04:44:36,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:39,829 INFO L124 PetriNetUnfolderBase]: 35431/48694 cut-off events. [2025-02-06 04:44:39,830 INFO L125 PetriNetUnfolderBase]: For 198333/198571 co-relation queries the response was YES. [2025-02-06 04:44:40,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196681 conditions, 48694 events. 35431/48694 cut-off events. For 198333/198571 co-relation queries the response was YES. Maximal size of possible extension queue 2318. Compared 319267 event pairs, 6353 based on Foata normal form. 538/48673 useless extension candidates. Maximal degree in co-relation 166887. Up to 18303 conditions per place. [2025-02-06 04:44:40,321 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 308 selfloop transitions, 63 changer transitions 0/380 dead transitions. [2025-02-06 04:44:40,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 380 transitions, 4016 flow [2025-02-06 04:44:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:44:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:44:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-02-06 04:44:40,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2025-02-06 04:44:40,324 INFO L175 Difference]: Start difference. First operand has 82 places, 129 transitions, 1139 flow. Second operand 6 states and 189 transitions. [2025-02-06 04:44:40,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 380 transitions, 4016 flow [2025-02-06 04:44:41,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 380 transitions, 3920 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:41,098 INFO L231 Difference]: Finished difference. Result has 92 places, 160 transitions, 1752 flow [2025-02-06 04:44:41,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1752, PETRI_PLACES=92, PETRI_TRANSITIONS=160} [2025-02-06 04:44:41,098 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 44 predicate places. [2025-02-06 04:44:41,099 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 160 transitions, 1752 flow [2025-02-06 04:44:41,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:41,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:41,099 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] [2025-02-06 04:44:41,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:44:41,099 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-02-06 04:44:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 459230517, now seen corresponding path program 4 times [2025-02-06 04:44:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928912941] [2025-02-06 04:44:41,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:41,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:44:41,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:41,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:41,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928912941] [2025-02-06 04:44:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928912941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270878035] [2025-02-06 04:44:41,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:41,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:41,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:44:41,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:44:41,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:41,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:41,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:44:41,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:41,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270878035] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:44:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 16 [2025-02-06 04:44:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675987889] [2025-02-06 04:44:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:41,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:44:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:41,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:44:41,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:44:41,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:44:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 160 transitions, 1752 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:41,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:44:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:51,563 INFO L124 PetriNetUnfolderBase]: 97789/132717 cut-off events. [2025-02-06 04:44:51,563 INFO L125 PetriNetUnfolderBase]: For 640100/641240 co-relation queries the response was YES. [2025-02-06 04:44:52,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566760 conditions, 132717 events. 97789/132717 cut-off events. For 640100/641240 co-relation queries the response was YES. Maximal size of possible extension queue 5456. Compared 901521 event pairs, 4486 based on Foata normal form. 377/125473 useless extension candidates. Maximal degree in co-relation 437760. Up to 28472 conditions per place. [2025-02-06 04:44:52,687 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 567 selfloop transitions, 176 changer transitions 0/749 dead transitions. [2025-02-06 04:44:52,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 749 transitions, 8993 flow [2025-02-06 04:44:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:44:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:44:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 419 transitions. [2025-02-06 04:44:52,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6348484848484849 [2025-02-06 04:44:52,690 INFO L175 Difference]: Start difference. First operand has 92 places, 160 transitions, 1752 flow. Second operand 15 states and 419 transitions. [2025-02-06 04:44:52,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 749 transitions, 8993 flow [2025-02-06 04:44:56,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 749 transitions, 8977 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:56,334 INFO L231 Difference]: Finished difference. Result has 119 places, 299 transitions, 3871 flow [2025-02-06 04:44:56,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3871, PETRI_PLACES=119, PETRI_TRANSITIONS=299} [2025-02-06 04:44:56,335 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 71 predicate places. [2025-02-06 04:44:56,336 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 299 transitions, 3871 flow [2025-02-06 04:44:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:44:56,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:56,336 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] [2025-02-06 04:44:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:44:56,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:56,537 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-02-06 04:44:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash -384574869, now seen corresponding path program 5 times [2025-02-06 04:44:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718138388] [2025-02-06 04:44:56,537 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:56,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:44:56,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:56,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718138388] [2025-02-06 04:44:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718138388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513413139] [2025-02-06 04:44:56,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:56,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:44:56,746 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:44:56,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:44:56,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:56,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:56,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:44:56,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:56,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513413139] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:44:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-02-06 04:44:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126560543] [2025-02-06 04:44:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:44:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:56,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:44:56,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:44:56,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:44:56,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 299 transitions, 3871 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-02-06 04:44:56,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:56,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:44:56,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:07,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][671], [60#true, 114#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 39#L132-1true, Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 468#(< 0 (mod thread2Thread1of1ForFork0_~cond~1 256)), Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 36#L47true, Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 12#L72true, Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), 11#L110true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:07,414 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-06 04:45:07,414 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:07,414 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:07,414 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:07,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][671], [60#true, 114#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 39#L132-1true, Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 468#(< 0 (mod thread2Thread1of1ForFork0_~cond~1 256)), 37#L53true, 29#L66true, Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), 11#L110true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:07,494 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-06 04:45:07,494 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:07,494 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:07,494 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:45:09,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][671], [60#true, 114#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 468#(< 0 (mod thread2Thread1of1ForFork0_~cond~1 256)), 16#L133true, Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 36#L47true, Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 12#L72true, Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 11#L110true, Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:09,168 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:45:09,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][671], [60#true, 114#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 39#L132-1true, Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 468#(< 0 (mod thread2Thread1of1ForFork0_~cond~1 256)), 37#L53true, Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 12#L72true, Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), 11#L110true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:09,176 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:45:09,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][671], [60#true, 114#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 468#(< 0 (mod thread2Thread1of1ForFork0_~cond~1 256)), 37#L53true, 29#L66true, 16#L133true, Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), 11#L110true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:09,239 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:45:09,239 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,239 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,240 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= (+ v_~p2~0_68 (* v_~m~0_57 2)) v_~p2~0_67) (< 1 v_~n2~0_87) (= v_~n2~0_87 (+ v_~n2~0_86 2))) (and (= v_~p2~0_68 v_~p2~0_67) (<= v_~n2~0_87 1) (= v_~n2~0_87 v_~n2~0_86))) InVars {~n2~0=v_~n2~0_87, ~p2~0=v_~p2~0_68, ~m~0=v_~m~0_57} OutVars{~n2~0=v_~n2~0_86, ~p2~0=v_~p2~0_67, ~m~0=v_~m~0_57} AuxVars[] AssignedVars[~n2~0, ~p2~0][698], [114#true, Black: 60#true, Black: 63#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 33#L46true, Black: 66#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 251#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 64#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 95#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 326#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 322#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 320#(and (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 328#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 310#(or (< 0 ~n2~0) (< ~n1~0 1)), Black: 74#(= ~n2~0 ~n1~0), Black: 83#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 324#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 334#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), Black: 77#(<= 1 ~n2~0), Black: 78#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 39#L132-1true, Black: 291#(or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 79#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 318#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 126#true, 21#L85true, Black: 76#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 81#(and (= ~n2~0 ~n1~0) (or (< 0 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 0))), Black: 330#(and (or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))) (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 258#(or (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)) (< 0 (mod thread4Thread1of1ForFork1_~cond~3 256))), 29#L66true, Black: 101#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 62#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 99#(and (or (= ~n2~0 ~n1~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 96#(<= ~n1~0 0), Black: 103#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (= ~n2~0 ~n1~0) (< ~n1~0 1)), Black: 105#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 94#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 538#(and (or (< 0 ~n1~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread2Thread1of1ForFork0_~cond~1 256))), Black: 120#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 116#(or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))), 11#L110true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 117#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 118#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0))]) [2025-02-06 04:45:09,240 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:45:09,240 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,240 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:45:09,240 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event