./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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-3061b6d-m [2024-11-19 09:54:30,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:54:30,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:54:30,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:54:30,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:54:30,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:54:30,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:54:30,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:54:30,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:54:30,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:54:30,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:54:30,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:54:30,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:54:30,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:54:30,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:54:30,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:54:30,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:54:30,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:54:30,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:54:30,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:54:30,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:54:30,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:54:30,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:54:30,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:54:30,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:54:30,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:54:30,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:54:30,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:54:30,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:54:30,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:54:30,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:54:30,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:54:30,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:54:30,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:54:30,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:54:30,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:54:30,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:54:30,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:54:30,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:54:30,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:54:30,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:54:30,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:54:30,291 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-19 09:54:30,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:54:30,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:54:30,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:54:30,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:54:30,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:54:30,592 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-19 09:54:32,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:54:32,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:54:32,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-19 09:54:32,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a7d196f/c8ca92c979ec4b79a4a9d13aee36c7a6/FLAG740ead6fa [2024-11-19 09:54:32,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a7d196f/c8ca92c979ec4b79a4a9d13aee36c7a6 [2024-11-19 09:54:32,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:54:32,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:54:32,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:54:32,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:54:32,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:54:32,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:32" (1/1) ... [2024-11-19 09:54:32,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20429431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:32, skipping insertion in model container [2024-11-19 09:54:32,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:32" (1/1) ... [2024-11-19 09:54:32,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:54:33,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:54:33,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:54:33,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:54:33,065 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:54:33,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33 WrapperNode [2024-11-19 09:54:33,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:54:33,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:54:33,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:54:33,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:54:33,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,099 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-19 09:54:33,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:54:33,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:54:33,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:54:33,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:54:33,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,133 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-19 09:54:33,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:54:33,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:54:33,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:54:33,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:54:33,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 09:54:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:54:33,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:33,199 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-19 09:54:33,202 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-19 09:54:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:54:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:54:33,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:54:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:54:33,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:54:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:54:33,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:54:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:54:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:54:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:54:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:54:33,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:54:33,258 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:54:33,380 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:54:33,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:54:33,646 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:54:33,646 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:54:33,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:54:33,846 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 09:54:33,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:33 BoogieIcfgContainer [2024-11-19 09:54:33,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:54:33,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:54:33,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:54:33,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:54:33,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:54:32" (1/3) ... [2024-11-19 09:54:33,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d98480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:33, skipping insertion in model container [2024-11-19 09:54:33,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (2/3) ... [2024-11-19 09:54:33,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d98480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:33, skipping insertion in model container [2024-11-19 09:54:33,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:33" (3/3) ... [2024-11-19 09:54:33,855 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-19 09:54:33,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:54:33,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:54:33,870 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:54:33,925 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:54:33,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2024-11-19 09:54:34,000 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-11-19 09:54:34,001 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:54:34,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 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/29 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-19 09:54:34,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2024-11-19 09:54:34,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-11-19 09:54:34,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:54:34,026 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=None, 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;@4899d1f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:54:34,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:54:34,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:54:34,065 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-11-19 09:54:34,065 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:54:34,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:34,066 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-19 09:54:34,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:34,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1376780756, now seen corresponding path program 1 times [2024-11-19 09:54:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:34,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097862040] [2024-11-19 09:54:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:34,941 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-19 09:54:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:34,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097862040] [2024-11-19 09:54:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097862040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:34,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:54:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380812951] [2024-11-19 09:54:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:34,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:54:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:54:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:54:35,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-19 09:54:35,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-19 09:54:35,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:35,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-19 09:54:35,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:35,300 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-11-19 09:54:35,301 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-19 09:54:35,308 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 63. Compared 3364 event pairs, 26 based on Foata normal form. 21/660 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-11-19 09:54:35,317 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-19 09:54:35,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-11-19 09:54:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:54:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:54:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-19 09:54:35,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-11-19 09:54:35,333 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 100 transitions. [2024-11-19 09:54:35,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-11-19 09:54:35,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:54:35,344 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-11-19 09:54:35,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, 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-19 09:54:35,352 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-11-19 09:54:35,353 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-11-19 09:54:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-19 09:54:35,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:35,354 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-19 09:54:35,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:54:35,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:35,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -73418991, now seen corresponding path program 1 times [2024-11-19 09:54:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018561268] [2024-11-19 09:54:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:35,840 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-19 09:54:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018561268] [2024-11-19 09:54:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018561268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:54:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637736175] [2024-11-19 09:54:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:54:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:54:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:54:35,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-19 09:54:35,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:54:35,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:35,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-19 09:54:35,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:36,094 INFO L124 PetriNetUnfolderBase]: 498/815 cut-off events. [2024-11-19 09:54:36,095 INFO L125 PetriNetUnfolderBase]: For 258/314 co-relation queries the response was YES. [2024-11-19 09:54:36,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 815 events. 498/815 cut-off events. For 258/314 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3762 event pairs, 52 based on Foata normal form. 82/872 useless extension candidates. Maximal degree in co-relation 1568. Up to 589 conditions per place. [2024-11-19 09:54:36,105 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-19 09:54:36,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 292 flow [2024-11-19 09:54:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:54:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:54:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-19 09:54:36,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-11-19 09:54:36,108 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 103 transitions. [2024-11-19 09:54:36,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 292 flow [2024-11-19 09:54:36,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:54:36,113 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 154 flow [2024-11-19 09:54:36,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2024-11-19 09:54:36,114 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-19 09:54:36,115 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 154 flow [2024-11-19 09:54:36,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:54:36,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:36,115 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-19 09:54:36,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:54:36,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:36,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 791968913, now seen corresponding path program 2 times [2024-11-19 09:54:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671435278] [2024-11-19 09:54:36,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:54:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:36,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:54:36,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:36,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671435278] [2024-11-19 09:54:36,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671435278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085575660] [2024-11-19 09:54:36,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:54:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:36,391 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-19 09:54:36,393 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-19 09:54:36,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:54:36,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:36,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:54:36,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:36,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085575660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:36,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 09:54:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360287626] [2024-11-19 09:54:36,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:36,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:54:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:36,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:54:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:54:36,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-19 09:54:36,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 154 flow. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-19 09:54:36,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:36,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-19 09:54:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:37,234 INFO L124 PetriNetUnfolderBase]: 1092/1677 cut-off events. [2024-11-19 09:54:37,234 INFO L125 PetriNetUnfolderBase]: For 940/1101 co-relation queries the response was YES. [2024-11-19 09:54:37,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 1677 events. 1092/1677 cut-off events. For 940/1101 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8223 event pairs, 74 based on Foata normal form. 205/1856 useless extension candidates. Maximal degree in co-relation 3789. Up to 501 conditions per place. [2024-11-19 09:54:37,251 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2024-11-19 09:54:37,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 96 transitions, 515 flow [2024-11-19 09:54:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:54:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:54:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-11-19 09:54:37,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2024-11-19 09:54:37,253 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 154 flow. Second operand 7 states and 168 transitions. [2024-11-19 09:54:37,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 96 transitions, 515 flow [2024-11-19 09:54:37,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:54:37,261 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 218 flow [2024-11-19 09:54:37,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-11-19 09:54:37,263 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-11-19 09:54:37,263 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 218 flow [2024-11-19 09:54:37,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-19 09:54:37,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:37,264 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-19 09:54:37,282 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-19 09:54:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:37,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 653478958, now seen corresponding path program 1 times [2024-11-19 09:54:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:37,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871243945] [2024-11-19 09:54:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871243945] [2024-11-19 09:54:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871243945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530565436] [2024-11-19 09:54:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:37,728 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-19 09:54:37,730 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-19 09:54:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:37,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:54:37,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:38,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-19 09:54:38,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:38,204 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-19 09:54:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530565436] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:38,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:54:38,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 8] total 12 [2024-11-19 09:54:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951427929] [2024-11-19 09:54:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:38,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:54:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:54:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:54:38,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-19 09:54:38,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-19 09:54:38,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:38,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-19 09:54:38,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:38,774 INFO L124 PetriNetUnfolderBase]: 2254/3420 cut-off events. [2024-11-19 09:54:38,774 INFO L125 PetriNetUnfolderBase]: For 4089/4200 co-relation queries the response was YES. [2024-11-19 09:54:38,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 conditions, 3420 events. 2254/3420 cut-off events. For 4089/4200 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17883 event pairs, 323 based on Foata normal form. 79/3198 useless extension candidates. Maximal degree in co-relation 6613. Up to 1161 conditions per place. [2024-11-19 09:54:38,805 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 85 selfloop transitions, 22 changer transitions 9/128 dead transitions. [2024-11-19 09:54:38,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 128 transitions, 795 flow [2024-11-19 09:54:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:54:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:54:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-11-19 09:54:38,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2024-11-19 09:54:38,811 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 218 flow. Second operand 7 states and 159 transitions. [2024-11-19 09:54:38,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 128 transitions, 795 flow [2024-11-19 09:54:38,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 128 transitions, 781 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-19 09:54:38,831 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 414 flow [2024-11-19 09:54:38,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-11-19 09:54:38,833 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-11-19 09:54:38,834 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 414 flow [2024-11-19 09:54:38,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-19 09:54:38,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:38,835 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-19 09:54:38,852 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-19 09:54:39,035 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,SelfDestructingSolverStorable3 [2024-11-19 09:54:39,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:39,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 82819996, now seen corresponding path program 2 times [2024-11-19 09:54:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426399302] [2024-11-19 09:54:39,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:54:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:39,076 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:54:39,077 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:39,307 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-19 09:54:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426399302] [2024-11-19 09:54:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426399302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598341777] [2024-11-19 09:54:39,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:54:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:39,311 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-19 09:54:39,313 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-19 09:54:39,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:54:39,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:39,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:54:39,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:39,457 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-19 09:54:39,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:39,528 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-19 09:54:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598341777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:39,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-11-19 09:54:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493408272] [2024-11-19 09:54:39,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:54:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:54:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:54:39,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-19 09:54:39,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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-19 09:54:39,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:39,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-19 09:54:39,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:40,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][68], [16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, 402#true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,154 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-19 09:54:40,154 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:40,154 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:40,155 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:40,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][132], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 22#L69true, 402#true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,155 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,155 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,155 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,155 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][68], [16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 12#L113true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, 402#true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,187 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,187 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][132], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 402#true, Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,188 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 5#L91true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,195 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 5#L91true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,322 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][68], [47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 11#thread2EXITtrue, 402#true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,325 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][132], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 25#L88true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 402#true, Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,326 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,326 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 14#thread3EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,333 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [9#L83true, 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,335 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,335 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,335 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,335 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:40,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [9#L83true, 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,336 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 5#L91true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,337 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2024-11-19 09:54:40,337 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-11-19 09:54:40,337 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-11-19 09:54:40,337 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-11-19 09:54:40,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 14#thread3EXITtrue, 16#thread1EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,359 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,360 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,360 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,360 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [9#L83true, 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 12#L113true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,361 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,361 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,361 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,361 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [9#L83true, 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 12#L113true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,362 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,362 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,362 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,362 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 5#L91true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,363 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 5#L91true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,364 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,364 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,364 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,364 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 16#thread1EXITtrue, 14#thread3EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,372 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-11-19 09:54:40,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [37#L85true, 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,374 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,374 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,375 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,375 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:40,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [37#L85true, 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 35#L112-4true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,375 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,375 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 16#thread1EXITtrue, 14#thread3EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 12#L113true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,386 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,387 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,387 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,387 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][144], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 14#thread3EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,388 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,388 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,388 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,388 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [37#L85true, 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 12#L113true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,392 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,392 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,392 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,393 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [37#L85true, 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 16#thread1EXITtrue, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 12#L113true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,393 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,393 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,393 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,393 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [9#L83true, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,395 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,395 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,395 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,395 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:40,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [9#L83true, 161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 21#L113-1true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,439 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), 5#L91true, Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,441 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,441 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,441 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,442 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-11-19 09:54:40,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][67], [350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), 14#thread3EXITtrue, 47#true, Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 217#true, 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 404#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,451 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-11-19 09:54:40,451 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-19 09:54:40,451 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-19 09:54:40,452 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-19 09:54:40,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][71], [37#L85true, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), 217#true, Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,453 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:40,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] 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][54], [161#(< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)), 37#L85true, 47#true, Black: 350#(= (mod thread3Thread1of1ForFork0_~cond~2 256) 0), Black: 395#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (mod ~u~0 4294967296) 0)), 217#true, Black: 372#(or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 249#(<= (mod ~u~0 4294967296) 0), Black: 392#(and (= (mod thread3Thread1of1ForFork0_~cond~2 256) 0) (or (< (mod ~u~0 4294967296) 1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 65#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 195#(or (< 0 (mod ~u~0 4294967296)) (= (mod thread2Thread1of1ForFork2_~cond~1 256) 0)), Black: 63#true, 431#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 212#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)), 21#L113-1true, 22#L69true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-19 09:54:40,455 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:40,455 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:40,455 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:40,455 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:40,465 INFO L124 PetriNetUnfolderBase]: 3454/5038 cut-off events. [2024-11-19 09:54:40,465 INFO L125 PetriNetUnfolderBase]: For 10375/10469 co-relation queries the response was YES. [2024-11-19 09:54:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18600 conditions, 5038 events. 3454/5038 cut-off events. For 10375/10469 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 26512 event pairs, 107 based on Foata normal form. 182/5064 useless extension candidates. Maximal degree in co-relation 15827. Up to 986 conditions per place. [2024-11-19 09:54:40,517 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 119 selfloop transitions, 51 changer transitions 0/182 dead transitions. [2024-11-19 09:54:40,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 182 transitions, 1400 flow [2024-11-19 09:54:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:54:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:54:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-11-19 09:54:40,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-11-19 09:54:40,520 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 414 flow. Second operand 12 states and 234 transitions. [2024-11-19 09:54:40,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 182 transitions, 1400 flow [2024-11-19 09:54:40,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 182 transitions, 1394 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-19 09:54:40,549 INFO L231 Difference]: Finished difference. Result has 83 places, 105 transitions, 875 flow [2024-11-19 09:54:40,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=875, PETRI_PLACES=83, PETRI_TRANSITIONS=105} [2024-11-19 09:54:40,550 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-11-19 09:54:40,551 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 105 transitions, 875 flow [2024-11-19 09:54:40,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 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-19 09:54:40,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:40,551 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-19 09:54:40,570 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-19 09:54:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:40,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1070244984, now seen corresponding path program 3 times [2024-11-19 09:54:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720207892] [2024-11-19 09:54:40,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:54:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:40,826 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 09:54:40,826 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:42,347 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-19 09:54:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720207892] [2024-11-19 09:54:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720207892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071948066] [2024-11-19 09:54:42,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:54:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:42,351 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-19 09:54:42,352 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-19 09:54:42,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 09:54:42,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:42,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:54:42,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:43,530 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-19 09:54:43,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:44,580 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-19 09:54:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071948066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:44,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2024-11-19 09:54:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590613704] [2024-11-19 09:54:44,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:44,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 09:54:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 09:54:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:54:44,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-19 09:54:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 105 transitions, 875 flow. Second operand has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 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-19 09:54:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-19 09:54:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:52,499 INFO L124 PetriNetUnfolderBase]: 16432/24698 cut-off events. [2024-11-19 09:54:52,499 INFO L125 PetriNetUnfolderBase]: For 86588/86824 co-relation queries the response was YES. [2024-11-19 09:54:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103362 conditions, 24698 events. 16432/24698 cut-off events. For 86588/86824 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 169515 event pairs, 802 based on Foata normal form. 162/24240 useless extension candidates. Maximal degree in co-relation 88676. Up to 4163 conditions per place. [2024-11-19 09:54:52,808 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 595 selfloop transitions, 425 changer transitions 53/1085 dead transitions. [2024-11-19 09:54:52,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1085 transitions, 10792 flow [2024-11-19 09:54:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-19 09:54:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2024-11-19 09:54:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1155 transitions. [2024-11-19 09:54:52,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5574324324324325 [2024-11-19 09:54:52,815 INFO L175 Difference]: Start difference. First operand has 83 places, 105 transitions, 875 flow. Second operand 56 states and 1155 transitions. [2024-11-19 09:54:52,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1085 transitions, 10792 flow [2024-11-19 09:54:53,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1085 transitions, 10360 flow, removed 216 selfloop flow, removed 0 redundant places. [2024-11-19 09:54:53,422 INFO L231 Difference]: Finished difference. Result has 166 places, 592 transitions, 7172 flow [2024-11-19 09:54:53,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=7172, PETRI_PLACES=166, PETRI_TRANSITIONS=592} [2024-11-19 09:54:53,423 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2024-11-19 09:54:53,424 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 592 transitions, 7172 flow [2024-11-19 09:54:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 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-19 09:54:53,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:53,424 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-19 09:54:53,442 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-19 09:54:53,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:53,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:54:53,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1876099856, now seen corresponding path program 4 times [2024-11-19 09:54:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978084111] [2024-11-19 09:54:53,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:54:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:53,678 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:54:53,678 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:55,294 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-19 09:54:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:55,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978084111] [2024-11-19 09:54:55,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978084111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:55,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959585066] [2024-11-19 09:54:55,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:54:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:55,298 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-19 09:54:55,300 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-19 09:54:55,401 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:54:55,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:54:55,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:54:55,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:56,223 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-19 09:54:56,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:57,357 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-19 09:54:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959585066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:57,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-19 09:54:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498745508] [2024-11-19 09:54:57,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:57,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 09:54:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:57,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 09:54:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:54:57,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-19 09:54:57,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 592 transitions, 7172 flow. Second operand has 23 states, 23 states have (on average 16.652173913043477) internal successors, (383), 23 states have internal predecessors, (383), 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-19 09:54:57,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:57,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-19 09:54:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:55:12,293 INFO L124 PetriNetUnfolderBase]: 27867/45094 cut-off events. [2024-11-19 09:55:12,294 INFO L125 PetriNetUnfolderBase]: For 356467/361476 co-relation queries the response was YES. [2024-11-19 09:55:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240210 conditions, 45094 events. 27867/45094 cut-off events. For 356467/361476 co-relation queries the response was YES. Maximal size of possible extension queue 2615. Compared 385768 event pairs, 1199 based on Foata normal form. 2264/46609 useless extension candidates. Maximal degree in co-relation 239985. Up to 7883 conditions per place. [2024-11-19 09:55:13,023 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 938 selfloop transitions, 1208 changer transitions 150/2321 dead transitions. [2024-11-19 09:55:13,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 2321 transitions, 31525 flow [2024-11-19 09:55:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:55:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-11-19 09:55:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1606 transitions. [2024-11-19 09:55:13,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6113437381043015 [2024-11-19 09:55:13,029 INFO L175 Difference]: Start difference. First operand has 166 places, 592 transitions, 7172 flow. Second operand 71 states and 1606 transitions. [2024-11-19 09:55:13,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 2321 transitions, 31525 flow [2024-11-19 09:55:22,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2321 transitions, 29783 flow, removed 871 selfloop flow, removed 2 redundant places. [2024-11-19 09:55:22,426 INFO L231 Difference]: Finished difference. Result has 281 places, 1580 transitions, 22988 flow [2024-11-19 09:55:22,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6636, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=22988, PETRI_PLACES=281, PETRI_TRANSITIONS=1580} [2024-11-19 09:55:22,427 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 241 predicate places. [2024-11-19 09:55:22,428 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 1580 transitions, 22988 flow [2024-11-19 09:55:22,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 16.652173913043477) internal successors, (383), 23 states have internal predecessors, (383), 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-19 09:55:22,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:55:22,428 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, 1, 1, 1] [2024-11-19 09:55:22,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:55:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:55:22,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:55:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:55:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2000662895, now seen corresponding path program 1 times [2024-11-19 09:55:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:55:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869887841] [2024-11-19 09:55:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:55:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:55:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:55:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:55:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:55:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869887841] [2024-11-19 09:55:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869887841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:55:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348929801] [2024-11-19 09:55:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:55:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:55:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:55:22,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:55:22,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:55:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:55:22,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:55:22,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:55:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:55:23,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:55:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:55:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348929801] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:55:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:55:23,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 7] total 13 [2024-11-19 09:55:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083810549] [2024-11-19 09:55:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:55:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:55:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:55:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:55:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:55:23,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-19 09:55:23,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 1580 transitions, 22988 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-19 09:55:23,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:55:23,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-19 09:55:23,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:55:45,366 INFO L124 PetriNetUnfolderBase]: 40227/65390 cut-off events. [2024-11-19 09:55:45,366 INFO L125 PetriNetUnfolderBase]: For 762084/772757 co-relation queries the response was YES. [2024-11-19 09:55:46,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395682 conditions, 65390 events. 40227/65390 cut-off events. For 762084/772757 co-relation queries the response was YES. Maximal size of possible extension queue 3427. Compared 583339 event pairs, 3713 based on Foata normal form. 3991/68543 useless extension candidates. Maximal degree in co-relation 394537. Up to 12731 conditions per place. [2024-11-19 09:55:47,054 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 1661 selfloop transitions, 1032 changer transitions 0/2718 dead transitions. [2024-11-19 09:55:47,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2718 transitions, 44947 flow [2024-11-19 09:55:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:55:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:55:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-11-19 09:55:47,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6988416988416989 [2024-11-19 09:55:47,055 INFO L175 Difference]: Start difference. First operand has 281 places, 1580 transitions, 22988 flow. Second operand 7 states and 181 transitions. [2024-11-19 09:55:47,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 2718 transitions, 44947 flow