./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:53:47,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:53:47,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:53:47,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:53:47,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:53:47,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:53:47,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:53:47,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:53:47,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:53:47,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:53:47,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:53:47,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:53:47,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:53:47,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:53:47,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:53:47,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:53:47,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:53:47,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:53:47,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:53:47,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:53:47,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:53:47,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:53:47,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:53:47,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:53:47,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:53:47,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:53:47,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:53:47,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:53:47,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:53:47,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:53:47,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:53:47,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:53:47,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:53:47,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:53:47,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:53:47,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:53:47,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:53:47,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:53:47,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:53:47,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:53:47,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:53:47,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:53:47,906 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-11-22 13:53:48,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:53:48,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:53:48,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:53:48,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:53:48,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:53:48,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-22 13:53:49,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:53:49,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:53:49,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-22 13:53:49,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca48e742/e8e8cbf8ab6042f3b004f8b4a816bbbc/FLAGe00830a68 [2024-11-22 13:53:49,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca48e742/e8e8cbf8ab6042f3b004f8b4a816bbbc [2024-11-22 13:53:49,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:53:49,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:53:49,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:53:49,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:53:49,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:53:49,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:49" (1/1) ... [2024-11-22 13:53:49,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748b7017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:49, skipping insertion in model container [2024-11-22 13:53:49,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:49" (1/1) ... [2024-11-22 13:53:49,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:53:50,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2024-11-22 13:53:50,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:53:50,177 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:53:50,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2024-11-22 13:53:50,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:53:50,232 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:53:50,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50 WrapperNode [2024-11-22 13:53:50,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:53:50,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:53:50,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:53:50,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:53:50,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,279 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-11-22 13:53:50,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:53:50,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:53:50,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:53:50,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:53:50,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,319 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]. [2024-11-22 13:53:50,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:53:50,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:53:50,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:53:50,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:53:50,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (1/1) ... [2024-11-22 13:53:50,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:53:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:50,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:53:50,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:53:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:53:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:53:50,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:53:50,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:53:50,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:53:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:53:50,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:53:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:53:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:53:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:53:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:53:50,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:53:50,419 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:53:50,512 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:53:50,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:53:50,777 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:53:50,777 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:53:50,950 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:53:50,951 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 13:53:50,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:50 BoogieIcfgContainer [2024-11-22 13:53:50,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:53:50,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:53:50,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:53:50,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:53:50,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:53:49" (1/3) ... [2024-11-22 13:53:50,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab98a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:50, skipping insertion in model container [2024-11-22 13:53:50,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:50" (2/3) ... [2024-11-22 13:53:50,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab98a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:50, skipping insertion in model container [2024-11-22 13:53:50,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:50" (3/3) ... [2024-11-22 13:53:50,962 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-22 13:53:50,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:53:50,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:53:50,977 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:53:51,079 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-22 13:53:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2024-11-22 13:53:51,170 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2024-11-22 13:53:51,170 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 13:53:51,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-22 13:53:51,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2024-11-22 13:53:51,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2024-11-22 13:53:51,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:53:51,204 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;@3c6c4314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:53:51,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 13:53:51,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:53:51,222 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-11-22 13:53:51,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 13:53:51,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:51,223 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:53:51,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1029020577, now seen corresponding path program 1 times [2024-11-22 13:53:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170260795] [2024-11-22 13:53:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170260795] [2024-11-22 13:53:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170260795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835899487] [2024-11-22 13:53:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:52,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:52,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:52,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 13:53:52,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2024-11-22 13:53:52,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:52,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 13:53:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:52,381 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-11-22 13:53:52,381 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-22 13:53:52,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3347 event pairs, 26 based on Foata normal form. 20/660 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-11-22 13:53:52,394 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-22 13:53:52,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-11-22 13:53:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-22 13:53:52,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-11-22 13:53:52,410 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 95 transitions. [2024-11-22 13:53:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-11-22 13:53:52,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 13:53:52,418 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-11-22 13:53:52,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-11-22 13:53:52,424 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-11-22 13:53:52,424 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-11-22 13:53:52,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2024-11-22 13:53:52,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:52,425 INFO L204 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] [2024-11-22 13:53:52,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:53:52,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:52,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 631285081, now seen corresponding path program 1 times [2024-11-22 13:53:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065652869] [2024-11-22 13:53:52,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:52,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:52,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065652869] [2024-11-22 13:53:52,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065652869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:52,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:52,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:53:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684470630] [2024-11-22 13:53:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:52,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:53:52,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:53:52,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:53:52,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 13:53:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2024-11-22 13:53:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:52,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 13:53:52,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:53,317 INFO L124 PetriNetUnfolderBase]: 1042/1669 cut-off events. [2024-11-22 13:53:53,317 INFO L125 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2024-11-22 13:53:53,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 1669 events. 1042/1669 cut-off events. For 412/448 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8714 event pairs, 288 based on Foata normal form. 24/1665 useless extension candidates. Maximal degree in co-relation 2474. Up to 925 conditions per place. [2024-11-22 13:53:53,331 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 59 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-11-22 13:53:53,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 87 transitions, 422 flow [2024-11-22 13:53:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-22 13:53:53,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6971428571428572 [2024-11-22 13:53:53,334 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 122 transitions. [2024-11-22 13:53:53,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 87 transitions, 422 flow [2024-11-22 13:53:53,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:53,374 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2024-11-22 13:53:53,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2024-11-22 13:53:53,376 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-11-22 13:53:53,376 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2024-11-22 13:53:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2024-11-22 13:53:53,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:53,376 INFO L204 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] [2024-11-22 13:53:53,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:53:53,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:53,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1270762887, now seen corresponding path program 2 times [2024-11-22 13:53:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:53,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340445316] [2024-11-22 13:53:53,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:53,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:53:53,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340445316] [2024-11-22 13:53:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340445316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:53,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291390936] [2024-11-22 13:53:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:53,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:53,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:53,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:53,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 13:53:53,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-22 13:53:53,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:53,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 13:53:53,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:53,798 INFO L124 PetriNetUnfolderBase]: 882/1459 cut-off events. [2024-11-22 13:53:53,799 INFO L125 PetriNetUnfolderBase]: For 1518/1597 co-relation queries the response was YES. [2024-11-22 13:53:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1459 events. 882/1459 cut-off events. For 1518/1597 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7920 event pairs, 115 based on Foata normal form. 106/1463 useless extension candidates. Maximal degree in co-relation 2996. Up to 750 conditions per place. [2024-11-22 13:53:53,810 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 62 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-22 13:53:53,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 541 flow [2024-11-22 13:53:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-22 13:53:53,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-11-22 13:53:53,813 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 4 states and 93 transitions. [2024-11-22 13:53:53,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 541 flow [2024-11-22 13:53:53,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 541 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:53,819 INFO L231 Difference]: Finished difference. Result has 48 places, 57 transitions, 302 flow [2024-11-22 13:53:53,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=48, PETRI_TRANSITIONS=57} [2024-11-22 13:53:53,821 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-11-22 13:53:53,821 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 302 flow [2024-11-22 13:53:53,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-22 13:53:53,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:53,822 INFO L204 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] [2024-11-22 13:53:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:53:53,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1055437246, now seen corresponding path program 1 times [2024-11-22 13:53:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232654236] [2024-11-22 13:53:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:54,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:54,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232654236] [2024-11-22 13:53:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232654236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:54,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883097323] [2024-11-22 13:53:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:54,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:54,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 13:53:54,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-22 13:53:54,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:54,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 13:53:54,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:54,297 INFO L124 PetriNetUnfolderBase]: 991/1645 cut-off events. [2024-11-22 13:53:54,298 INFO L125 PetriNetUnfolderBase]: For 1652/1802 co-relation queries the response was YES. [2024-11-22 13:53:54,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5247 conditions, 1645 events. 991/1645 cut-off events. For 1652/1802 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8884 event pairs, 156 based on Foata normal form. 144/1753 useless extension candidates. Maximal degree in co-relation 4128. Up to 1126 conditions per place. [2024-11-22 13:53:54,313 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 66 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2024-11-22 13:53:54,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 608 flow [2024-11-22 13:53:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-11-22 13:53:54,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-11-22 13:53:54,315 INFO L175 Difference]: Start difference. First operand has 48 places, 57 transitions, 302 flow. Second operand 5 states and 120 transitions. [2024-11-22 13:53:54,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 608 flow [2024-11-22 13:53:54,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:53:54,320 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 412 flow [2024-11-22 13:53:54,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2024-11-22 13:53:54,321 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2024-11-22 13:53:54,322 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 66 transitions, 412 flow [2024-11-22 13:53:54,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-22 13:53:54,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:54,322 INFO L204 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] [2024-11-22 13:53:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:53:54,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 620473468, now seen corresponding path program 2 times [2024-11-22 13:53:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965971827] [2024-11-22 13:53:54,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:54,337 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:53:54,337 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965971827] [2024-11-22 13:53:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965971827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964447632] [2024-11-22 13:53:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:54,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 13:53:54,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 66 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-22 13:53:54,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:54,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 13:53:54,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:54,732 INFO L124 PetriNetUnfolderBase]: 1225/2015 cut-off events. [2024-11-22 13:53:54,733 INFO L125 PetriNetUnfolderBase]: For 2889/3136 co-relation queries the response was YES. [2024-11-22 13:53:54,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 2015 events. 1225/2015 cut-off events. For 2889/3136 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11105 event pairs, 150 based on Foata normal form. 188/2155 useless extension candidates. Maximal degree in co-relation 5425. Up to 1106 conditions per place. [2024-11-22 13:53:54,754 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 83 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2024-11-22 13:53:54,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 820 flow [2024-11-22 13:53:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-22 13:53:54,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72 [2024-11-22 13:53:54,756 INFO L175 Difference]: Start difference. First operand has 53 places, 66 transitions, 412 flow. Second operand 5 states and 126 transitions. [2024-11-22 13:53:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 820 flow [2024-11-22 13:53:54,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 809 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:54,767 INFO L231 Difference]: Finished difference. Result has 59 places, 73 transitions, 512 flow [2024-11-22 13:53:54,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=512, PETRI_PLACES=59, PETRI_TRANSITIONS=73} [2024-11-22 13:53:54,769 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2024-11-22 13:53:54,770 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 512 flow [2024-11-22 13:53:54,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-22 13:53:54,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:54,770 INFO L204 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] [2024-11-22 13:53:54,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:53:54,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:54,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1698264060, now seen corresponding path program 1 times [2024-11-22 13:53:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:54,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626250067] [2024-11-22 13:53:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626250067] [2024-11-22 13:53:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626250067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200074967] [2024-11-22 13:53:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:55,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:55,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:55,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:53:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:55,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 13:53:55,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:55,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200074967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:53:55,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:53:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 11 [2024-11-22 13:53:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268159503] [2024-11-22 13:53:55,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:53:55,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:53:55,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:55,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:53:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:53:55,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-22 13:53:55,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 512 flow. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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) [2024-11-22 13:53:55,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:55,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-22 13:53:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:56,568 INFO L124 PetriNetUnfolderBase]: 3452/5069 cut-off events. [2024-11-22 13:53:56,569 INFO L125 PetriNetUnfolderBase]: For 14962/14962 co-relation queries the response was YES. [2024-11-22 13:53:56,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18990 conditions, 5069 events. 3452/5069 cut-off events. For 14962/14962 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26784 event pairs, 15 based on Foata normal form. 374/5442 useless extension candidates. Maximal degree in co-relation 7978. Up to 1225 conditions per place. [2024-11-22 13:53:56,622 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 239 selfloop transitions, 83 changer transitions 0/327 dead transitions. [2024-11-22 13:53:56,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 327 transitions, 2896 flow [2024-11-22 13:53:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 13:53:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-22 13:53:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 380 transitions. [2024-11-22 13:53:56,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4720496894409938 [2024-11-22 13:53:56,625 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 512 flow. Second operand 23 states and 380 transitions. [2024-11-22 13:53:56,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 327 transitions, 2896 flow [2024-11-22 13:53:56,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 327 transitions, 2831 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:56,649 INFO L231 Difference]: Finished difference. Result has 96 places, 143 transitions, 1259 flow [2024-11-22 13:53:56,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1259, PETRI_PLACES=96, PETRI_TRANSITIONS=143} [2024-11-22 13:53:56,652 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2024-11-22 13:53:56,652 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 143 transitions, 1259 flow [2024-11-22 13:53:56,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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) [2024-11-22 13:53:56,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:56,653 INFO L204 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] [2024-11-22 13:53:56,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:53:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 13:53:56,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash 466023864, now seen corresponding path program 2 times [2024-11-22 13:53:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571703547] [2024-11-22 13:53:56,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:56,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:56,893 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571703547] [2024-11-22 13:53:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571703547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318644079] [2024-11-22 13:53:57,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:57,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:57,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:57,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:53:57,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:57,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:57,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 13:53:57,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:57,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318644079] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:53:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2024-11-22 13:53:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252540922] [2024-11-22 13:53:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:57,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:53:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:53:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:53:57,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-22 13:53:57,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 143 transitions, 1259 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-22 13:53:57,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:57,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-22 13:53:57,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:58,511 INFO L124 PetriNetUnfolderBase]: 5140/7661 cut-off events. [2024-11-22 13:53:58,511 INFO L125 PetriNetUnfolderBase]: For 50053/50697 co-relation queries the response was YES. [2024-11-22 13:53:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34794 conditions, 7661 events. 5140/7661 cut-off events. For 50053/50697 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 44842 event pairs, 524 based on Foata normal form. 218/7654 useless extension candidates. Maximal degree in co-relation 24610. Up to 3941 conditions per place. [2024-11-22 13:53:58,659 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 151 selfloop transitions, 58 changer transitions 0/249 dead transitions. [2024-11-22 13:53:58,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 249 transitions, 2486 flow [2024-11-22 13:53:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:53:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:53:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-11-22 13:53:58,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-11-22 13:53:58,661 INFO L175 Difference]: Start difference. First operand has 96 places, 143 transitions, 1259 flow. Second operand 6 states and 141 transitions. [2024-11-22 13:53:58,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 249 transitions, 2486 flow [2024-11-22 13:53:58,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 249 transitions, 2410 flow, removed 38 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:58,791 INFO L231 Difference]: Finished difference. Result has 105 places, 175 transitions, 1713 flow [2024-11-22 13:53:58,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1713, PETRI_PLACES=105, PETRI_TRANSITIONS=175} [2024-11-22 13:53:58,792 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2024-11-22 13:53:58,792 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 175 transitions, 1713 flow [2024-11-22 13:53:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-22 13:53:58,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:58,793 INFO L204 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] [2024-11-22 13:53:58,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:53:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 13:53:58,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:53:58,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -154900872, now seen corresponding path program 3 times [2024-11-22 13:53:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138660096] [2024-11-22 13:53:58,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:59,018 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:59,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138660096] [2024-11-22 13:53:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138660096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009983022] [2024-11-22 13:53:59,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:59,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:59,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:53:59,291 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:59,291 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:59,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 13:53:59,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:59,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:53:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009983022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:59,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:53:59,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-11-22 13:53:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690737462] [2024-11-22 13:53:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:59,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:53:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:53:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:53:59,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-22 13:53:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 175 transitions, 1713 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-22 13:53:59,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:59,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-22 13:53:59,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:54:01,298 INFO L124 PetriNetUnfolderBase]: 7833/11676 cut-off events. [2024-11-22 13:54:01,298 INFO L125 PetriNetUnfolderBase]: For 88511/89438 co-relation queries the response was YES. [2024-11-22 13:54:01,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59805 conditions, 11676 events. 7833/11676 cut-off events. For 88511/89438 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 72953 event pairs, 558 based on Foata normal form. 265/11531 useless extension candidates. Maximal degree in co-relation 44386. Up to 4304 conditions per place. [2024-11-22 13:54:01,457 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 171 selfloop transitions, 93 changer transitions 0/304 dead transitions. [2024-11-22 13:54:01,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 304 transitions, 3433 flow [2024-11-22 13:54:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:54:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 13:54:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-11-22 13:54:01,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2024-11-22 13:54:01,459 INFO L175 Difference]: Start difference. First operand has 105 places, 175 transitions, 1713 flow. Second operand 7 states and 150 transitions. [2024-11-22 13:54:01,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 304 transitions, 3433 flow [2024-11-22 13:54:01,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 304 transitions, 3433 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:54:01,711 INFO L231 Difference]: Finished difference. Result has 115 places, 208 transitions, 2370 flow [2024-11-22 13:54:01,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2370, PETRI_PLACES=115, PETRI_TRANSITIONS=208} [2024-11-22 13:54:01,712 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2024-11-22 13:54:01,712 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 208 transitions, 2370 flow [2024-11-22 13:54:01,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-22 13:54:01,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:54:01,713 INFO L204 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] [2024-11-22 13:54:01,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:54:01,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:01,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:54:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:54:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1177146284, now seen corresponding path program 4 times [2024-11-22 13:54:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:54:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909497550] [2024-11-22 13:54:01,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:54:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:54:01,970 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:54:01,971 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:54:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909497550] [2024-11-22 13:54:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909497550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:54:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19025762] [2024-11-22 13:54:04,283 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:54:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:54:04,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:54:04,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:54:04,429 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:54:04,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:04,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 13:54:04,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:54:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:05,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:54:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19025762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:54:10,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:54:10,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-22 13:54:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195849341] [2024-11-22 13:54:10,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:54:10,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 13:54:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:54:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 13:54:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-11-22 13:54:11,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-22 13:54:11,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 208 transitions, 2370 flow. Second operand has 22 states, 22 states have (on average 15.636363636363637) internal successors, (344), 22 states have internal predecessors, (344), 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) [2024-11-22 13:54:11,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:54:11,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-22 13:54:11,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:54:27,543 WARN L286 SmtUtils]: Spent 11.23s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 13:54:36,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([302] L50-->L53: Formula: (= (ite (= 0 (ite (or (< 0 (mod v_~u~0_2 4294967296)) (< 0 (mod v_~t~0_2 4294967296)) (< 0 (mod v_~s~0_6 4294967296))) 1 0)) 0 1) v_thread1Thread1of1ForFork1_~cond~0_7) InVars {~u~0=v_~u~0_2, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_7, ~u~0=v_~u~0_2, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0][588], [Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), 33#L112-4true, Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 607#true, 8#L83true, 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 36#L72true, 34#L53true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 325#true, Black: 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0)))]) [2024-11-22 13:54:36,317 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][252], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), 33#L112-4true, Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 302#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 21#L69true, Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 768#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 16#L50true, 53#true, 5#L91true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 88#true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 325#true, Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0)))]) [2024-11-22 13:54:36,317 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][340], [Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), 33#L112-4true, Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 45#true, Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 607#true, 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 16#L50true, 53#true, 36#L72true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 35#L85true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 325#true, Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0)))]) [2024-11-22 13:54:36,630 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,630 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,630 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:36,630 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([302] L50-->L53: Formula: (= (ite (= 0 (ite (or (< 0 (mod v_~u~0_2 4294967296)) (< 0 (mod v_~t~0_2 4294967296)) (< 0 (mod v_~s~0_6 4294967296))) 1 0)) 0 1) v_thread1Thread1of1ForFork1_~cond~0_7) InVars {~u~0=v_~u~0_2, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_7, ~u~0=v_~u~0_2, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0][588], [Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 607#true, 8#L83true, 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 36#L72true, 34#L53true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 325#true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#L113true, Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))]) [2024-11-22 13:54:37,460 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][252], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 302#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 21#L69true, Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 768#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 16#L50true, 53#true, 5#L91true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 88#true, Black: 325#true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#L113true, Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-11-22 13:54:37,460 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,460 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,461 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,461 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][252], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), 33#L112-4true, Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 21#L69true, Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 768#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 8#L83true, 16#L50true, 53#true, 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 325#true, Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0)))]) [2024-11-22 13:54:37,558 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,558 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,558 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,558 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][340], [Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 607#true, 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 16#L50true, 53#true, 36#L72true, Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 325#true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), 35#L85true, Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#L113true, Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0)))]) [2024-11-22 13:54:37,919 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,919 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,919 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:37,919 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:54:38,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][252], [Black: 143#(= thread2Thread1of1ForFork2_~cond~1 1), Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 291#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 264#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 279#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))), Black: 68#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 75#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 72#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 73#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 84#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 81#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 546#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 21#L69true, Black: 601#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (= thread1Thread1of1ForFork1_~cond~0 1)), 45#true, Black: 598#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 595#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (= thread3Thread1of1ForFork0_~cond~2 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 550#(or (and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= thread3Thread1of1ForFork0_~cond~2 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1))), 439#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), 768#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 8#L83true, 16#L50true, 53#true, 306#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (<= 1 (mod thread2Thread1of1ForFork2_~cond~1 256))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 288#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 262#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 462#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 88#true, Black: 500#(and (or (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 325#true, Black: 283#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (= thread1Thread1of1ForFork1_~cond~0 1) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)))), Black: 286#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 266#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#L113true, Black: 275#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 273#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 271#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 90#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-11-22 13:54:38,348 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-22 13:54:38,348 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:54:38,348 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:54:38,348 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:54:41,787 INFO L124 PetriNetUnfolderBase]: 30783/49609 cut-off events. [2024-11-22 13:54:41,787 INFO L125 PetriNetUnfolderBase]: For 441970/447113 co-relation queries the response was YES. [2024-11-22 13:54:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266789 conditions, 49609 events. 30783/49609 cut-off events. For 441970/447113 co-relation queries the response was YES. Maximal size of possible extension queue 3054. Compared 424877 event pairs, 1014 based on Foata normal form. 1868/49840 useless extension candidates. Maximal degree in co-relation 209956. Up to 10281 conditions per place. [2024-11-22 13:54:42,602 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 631 selfloop transitions, 575 changer transitions 79/1366 dead transitions. [2024-11-22 13:54:42,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1366 transitions, 17559 flow [2024-11-22 13:54:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-22 13:54:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2024-11-22 13:54:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 1407 transitions. [2024-11-22 13:54:42,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6184615384615385 [2024-11-22 13:54:42,612 INFO L175 Difference]: Start difference. First operand has 115 places, 208 transitions, 2370 flow. Second operand 65 states and 1407 transitions. [2024-11-22 13:54:42,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1366 transitions, 17559 flow [2024-11-22 13:54:44,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1366 transitions, 17547 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-22 13:54:44,736 INFO L231 Difference]: Finished difference. Result has 206 places, 840 transitions, 12841 flow [2024-11-22 13:54:44,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=12841, PETRI_PLACES=206, PETRI_TRANSITIONS=840} [2024-11-22 13:54:44,737 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 168 predicate places. [2024-11-22 13:54:44,737 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 840 transitions, 12841 flow [2024-11-22 13:54:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.636363636363637) internal successors, (344), 22 states have internal predecessors, (344), 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) [2024-11-22 13:54:44,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:54:44,738 INFO L204 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] [2024-11-22 13:54:44,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 13:54:44,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:44,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:54:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:54:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1834522112, now seen corresponding path program 5 times [2024-11-22 13:54:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:54:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651932511] [2024-11-22 13:54:44,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:54:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:54:44,979 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-22 13:54:44,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:54:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651932511] [2024-11-22 13:54:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651932511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:54:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223196891] [2024-11-22 13:54:45,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:54:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:54:45,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:54:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:54:45,687 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-22 13:54:45,687 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:45,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 13:54:45,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:54:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:46,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:54:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223196891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:54:47,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:54:47,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2024-11-22 13:54:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957768564] [2024-11-22 13:54:47,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:54:47,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 13:54:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:54:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 13:54:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:54:47,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-11-22 13:54:47,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 840 transitions, 12841 flow. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 26 states have internal predecessors, (254), 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) [2024-11-22 13:54:47,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:54:47,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-11-22 13:54:47,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:55:01,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 13:55:05,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []