./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:37:18,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:37:18,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:37:19,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:37:19,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:37:19,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:37:19,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:37:19,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:37:19,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:37:19,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:37:19,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:37:19,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:37:19,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:37:19,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:37:19,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:37:19,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:37:19,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:37:19,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:37:19,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:37:19,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:37:19,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:37:19,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:37:19,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:37:19,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:37:19,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:37:19,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:37:19,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:37:19,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:37:19,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:37:19,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:37:19,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:37:19,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:37:19,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:37:19,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:37:19,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:37:19,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:37:19,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:37:19,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:37:19,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:37:19,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:37:19,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:37:19,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:37:19,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad [2024-10-14 14:37:19,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:37:19,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:37:19,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:37:19,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:37:19,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:37:19,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-10-14 14:37:20,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:37:21,059 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:37:21,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-10-14 14:37:21,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b6e29a7/92c0a33dadca477b9bfad657c793a23b/FLAG2779a3174 [2024-10-14 14:37:21,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b6e29a7/92c0a33dadca477b9bfad657c793a23b [2024-10-14 14:37:21,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:37:21,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:37:21,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:37:21,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:37:21,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:37:21,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ff3f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21, skipping insertion in model container [2024-10-14 14:37:21,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:37:21,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2989,3002] [2024-10-14 14:37:21,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:37:21,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:37:21,355 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2989,3002] [2024-10-14 14:37:21,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:37:21,376 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:37:21,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21 WrapperNode [2024-10-14 14:37:21,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:37:21,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:37:21,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:37:21,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:37:21,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,410 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-10-14 14:37:21,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:37:21,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:37:21,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:37:21,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:37:21,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,436 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-10-14 14:37:21,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:37:21,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:37:21,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:37:21,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:37:21,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (1/1) ... [2024-10-14 14:37:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:37:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:21,497 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-10-14 14:37:21,503 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-10-14 14:37:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:37:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 14:37:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 14:37:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 14:37:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 14:37:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 14:37:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 14:37:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:37:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:37:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:37:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:37:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:37:21,537 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:37:21,618 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:37:21,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:37:21,787 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:37:21,787 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:37:22,000 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:37:22,001 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 14:37:22,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:22 BoogieIcfgContainer [2024-10-14 14:37:22,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:37:22,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:37:22,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:37:22,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:37:22,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:37:21" (1/3) ... [2024-10-14 14:37:22,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca306d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:37:22, skipping insertion in model container [2024-10-14 14:37:22,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:21" (2/3) ... [2024-10-14 14:37:22,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca306d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:37:22, skipping insertion in model container [2024-10-14 14:37:22,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:22" (3/3) ... [2024-10-14 14:37:22,010 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-10-14 14:37:22,025 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:37:22,026 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:37:22,026 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:37:22,083 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 14:37:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 97 flow [2024-10-14 14:37:22,152 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-10-14 14:37:22,152 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 14:37:22,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-10-14 14:37:22,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 38 transitions, 97 flow [2024-10-14 14:37:22,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 86 flow [2024-10-14 14:37:22,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:37:22,176 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a087c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:37:22,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 14:37:22,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:37:22,189 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-10-14 14:37:22,190 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 14:37:22,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:22,191 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] [2024-10-14 14:37:22,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:22,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1795431148, now seen corresponding path program 1 times [2024-10-14 14:37:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87030039] [2024-10-14 14:37:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87030039] [2024-10-14 14:37:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87030039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:37:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452073212] [2024-10-14 14:37:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:37:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:22,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:37:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:37:22,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 38 [2024-10-14 14:37:22,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:22,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:22,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 38 [2024-10-14 14:37:22,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:23,293 INFO L124 PetriNetUnfolderBase]: 502/984 cut-off events. [2024-10-14 14:37:23,293 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-10-14 14:37:23,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 984 events. 502/984 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5752 event pairs, 34 based on Foata normal form. 54/959 useless extension candidates. Maximal degree in co-relation 1541. Up to 249 conditions per place. [2024-10-14 14:37:23,312 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 52 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2024-10-14 14:37:23,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 312 flow [2024-10-14 14:37:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:37:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:37:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-10-14 14:37:23,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2024-10-14 14:37:23,329 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 86 flow. Second operand 6 states and 170 transitions. [2024-10-14 14:37:23,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 312 flow [2024-10-14 14:37:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 75 transitions, 284 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 14:37:23,339 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 133 flow [2024-10-14 14:37:23,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-10-14 14:37:23,345 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-10-14 14:37:23,345 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 133 flow [2024-10-14 14:37:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:23,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:23,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:37:23,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash -920228961, now seen corresponding path program 1 times [2024-10-14 14:37:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142040824] [2024-10-14 14:37:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142040824] [2024-10-14 14:37:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142040824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:23,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:37:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283805904] [2024-10-14 14:37:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:37:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:23,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:37:23,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:37:23,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 38 [2024-10-14 14:37:23,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:23,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:23,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 38 [2024-10-14 14:37:23,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:23,618 INFO L124 PetriNetUnfolderBase]: 477/940 cut-off events. [2024-10-14 14:37:23,618 INFO L125 PetriNetUnfolderBase]: For 391/515 co-relation queries the response was YES. [2024-10-14 14:37:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 940 events. 477/940 cut-off events. For 391/515 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5135 event pairs, 149 based on Foata normal form. 42/880 useless extension candidates. Maximal degree in co-relation 1210. Up to 473 conditions per place. [2024-10-14 14:37:23,630 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 30 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2024-10-14 14:37:23,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 234 flow [2024-10-14 14:37:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:37:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:37:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-14 14:37:23,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7807017543859649 [2024-10-14 14:37:23,631 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 133 flow. Second operand 3 states and 89 transitions. [2024-10-14 14:37:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 234 flow [2024-10-14 14:37:23,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 14:37:23,637 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 155 flow [2024-10-14 14:37:23,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-10-14 14:37:23,637 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-10-14 14:37:23,638 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 155 flow [2024-10-14 14:37:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:23,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:23,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:37:23,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 676720779, now seen corresponding path program 1 times [2024-10-14 14:37:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043625626] [2024-10-14 14:37:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043625626] [2024-10-14 14:37:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043625626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:37:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619288607] [2024-10-14 14:37:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:37:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:23,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:37:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:37:23,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 38 [2024-10-14 14:37:23,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:23,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:23,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 38 [2024-10-14 14:37:23,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:23,952 INFO L124 PetriNetUnfolderBase]: 968/1773 cut-off events. [2024-10-14 14:37:23,952 INFO L125 PetriNetUnfolderBase]: For 696/732 co-relation queries the response was YES. [2024-10-14 14:37:23,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 1773 events. 968/1773 cut-off events. For 696/732 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11388 event pairs, 282 based on Foata normal form. 24/1597 useless extension candidates. Maximal degree in co-relation 2263. Up to 735 conditions per place. [2024-10-14 14:37:23,965 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 31 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2024-10-14 14:37:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 267 flow [2024-10-14 14:37:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:37:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:37:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-14 14:37:23,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7807017543859649 [2024-10-14 14:37:23,969 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 155 flow. Second operand 3 states and 89 transitions. [2024-10-14 14:37:23,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 267 flow [2024-10-14 14:37:23,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:37:23,974 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 171 flow [2024-10-14 14:37:23,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-10-14 14:37:23,975 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-10-14 14:37:23,976 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 171 flow [2024-10-14 14:37:23,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:23,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:23,976 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:23,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:37:23,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1874391122, now seen corresponding path program 1 times [2024-10-14 14:37:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872395683] [2024-10-14 14:37:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 14:37:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872395683] [2024-10-14 14:37:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872395683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:37:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374480668] [2024-10-14 14:37:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:24,147 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-10-14 14:37:24,150 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-10-14 14:37:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:24,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:37:24,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:37:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:37:24,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:37:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:37:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374480668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:37:24,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:37:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 6] total 11 [2024-10-14 14:37:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157289854] [2024-10-14 14:37:24,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:37:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:37:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:37:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:37:24,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-10-14 14:37:24,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 171 flow. Second operand has 11 states, 11 states have (on average 19.09090909090909) internal successors, (210), 11 states have internal predecessors, (210), 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-10-14 14:37:24,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:24,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-10-14 14:37:24,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:25,069 INFO L124 PetriNetUnfolderBase]: 1801/3024 cut-off events. [2024-10-14 14:37:25,069 INFO L125 PetriNetUnfolderBase]: For 1894/3361 co-relation queries the response was YES. [2024-10-14 14:37:25,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 3024 events. 1801/3024 cut-off events. For 1894/3361 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17458 event pairs, 54 based on Foata normal form. 188/2833 useless extension candidates. Maximal degree in co-relation 5411. Up to 693 conditions per place. [2024-10-14 14:37:25,106 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 83 selfloop transitions, 20 changer transitions 2/122 dead transitions. [2024-10-14 14:37:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 122 transitions, 661 flow [2024-10-14 14:37:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:37:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 14:37:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2024-10-14 14:37:25,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2024-10-14 14:37:25,108 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 171 flow. Second operand 12 states and 270 transitions. [2024-10-14 14:37:25,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 122 transitions, 661 flow [2024-10-14 14:37:25,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:37:25,117 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 316 flow [2024-10-14 14:37:25,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-10-14 14:37:25,118 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-10-14 14:37:25,119 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 316 flow [2024-10-14 14:37:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.09090909090909) internal successors, (210), 11 states have internal predecessors, (210), 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-10-14 14:37:25,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:25,120 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:25,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:37:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:25,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:25,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1942443312, now seen corresponding path program 2 times [2024-10-14 14:37:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:25,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724459623] [2024-10-14 14:37:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724459623] [2024-10-14 14:37:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724459623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:37:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592679684] [2024-10-14 14:37:25,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:37:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:25,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:25,491 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-10-14 14:37:25,492 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-10-14 14:37:25,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:37:25,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:37:25,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:37:25,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:37:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:25,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:37:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592679684] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:37:25,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:37:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2024-10-14 14:37:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569838543] [2024-10-14 14:37:25,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:37:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:37:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:37:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:37:25,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-10-14 14:37:25,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 316 flow. Second operand has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 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-10-14 14:37:25,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:25,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-10-14 14:37:25,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:27,710 INFO L124 PetriNetUnfolderBase]: 8480/15472 cut-off events. [2024-10-14 14:37:27,711 INFO L125 PetriNetUnfolderBase]: For 13852/13878 co-relation queries the response was YES. [2024-10-14 14:37:27,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40503 conditions, 15472 events. 8480/15472 cut-off events. For 13852/13878 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 126936 event pairs, 799 based on Foata normal form. 476/15233 useless extension candidates. Maximal degree in co-relation 27087. Up to 2835 conditions per place. [2024-10-14 14:37:27,843 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 90 selfloop transitions, 32 changer transitions 25/170 dead transitions. [2024-10-14 14:37:27,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 170 transitions, 1092 flow [2024-10-14 14:37:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:37:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 14:37:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2024-10-14 14:37:27,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6483253588516746 [2024-10-14 14:37:27,849 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 316 flow. Second operand 11 states and 271 transitions. [2024-10-14 14:37:27,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 170 transitions, 1092 flow [2024-10-14 14:37:27,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 170 transitions, 1080 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-14 14:37:27,920 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 621 flow [2024-10-14 14:37:27,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=621, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2024-10-14 14:37:27,923 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-10-14 14:37:27,923 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 621 flow [2024-10-14 14:37:27,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 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-10-14 14:37:27,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:27,924 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:27,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 14:37:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:28,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:28,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -65457908, now seen corresponding path program 3 times [2024-10-14 14:37:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625190650] [2024-10-14 14:37:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625190650] [2024-10-14 14:37:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625190650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:37:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633375492] [2024-10-14 14:37:28,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 14:37:28,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:28,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:28,486 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-10-14 14:37:28,488 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-10-14 14:37:28,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 14:37:28,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:37:28,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 14:37:28,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:37:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:28,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:37:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633375492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:37:28,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:37:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 14 [2024-10-14 14:37:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520716499] [2024-10-14 14:37:28,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:37:28,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 14:37:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 14:37:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:37:28,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-10-14 14:37:28,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 621 flow. Second operand has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-10-14 14:37:28,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:28,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-10-14 14:37:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:33,607 INFO L124 PetriNetUnfolderBase]: 29081/45453 cut-off events. [2024-10-14 14:37:33,608 INFO L125 PetriNetUnfolderBase]: For 97222/97222 co-relation queries the response was YES. [2024-10-14 14:37:33,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150575 conditions, 45453 events. 29081/45453 cut-off events. For 97222/97222 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 341135 event pairs, 2781 based on Foata normal form. 964/45596 useless extension candidates. Maximal degree in co-relation 110911. Up to 12894 conditions per place. [2024-10-14 14:37:33,927 INFO L140 encePairwiseOnDemand]: 23/38 looper letters, 190 selfloop transitions, 67 changer transitions 133/399 dead transitions. [2024-10-14 14:37:33,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 399 transitions, 3300 flow [2024-10-14 14:37:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 14:37:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-14 14:37:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 449 transitions. [2024-10-14 14:37:33,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5626566416040101 [2024-10-14 14:37:33,930 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 621 flow. Second operand 21 states and 449 transitions. [2024-10-14 14:37:33,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 399 transitions, 3300 flow [2024-10-14 14:37:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 399 transitions, 3284 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-14 14:37:34,478 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 1175 flow [2024-10-14 14:37:34,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1175, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2024-10-14 14:37:34,479 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2024-10-14 14:37:34,479 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 1175 flow [2024-10-14 14:37:34,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-10-14 14:37:34,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:34,479 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:34,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 14:37:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:34,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 289150256, now seen corresponding path program 1 times [2024-10-14 14:37:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126360762] [2024-10-14 14:37:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:34,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126360762] [2024-10-14 14:37:34,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126360762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:34,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:34,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:37:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987596506] [2024-10-14 14:37:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:37:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:37:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:37:34,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-10-14 14:37:34,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 1175 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:34,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:34,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-10-14 14:37:34,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:36,743 INFO L124 PetriNetUnfolderBase]: 6943/13599 cut-off events. [2024-10-14 14:37:36,743 INFO L125 PetriNetUnfolderBase]: For 105210/106035 co-relation queries the response was YES. [2024-10-14 14:37:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65736 conditions, 13599 events. 6943/13599 cut-off events. For 105210/106035 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 117614 event pairs, 1060 based on Foata normal form. 333/12957 useless extension candidates. Maximal degree in co-relation 64098. Up to 3053 conditions per place. [2024-10-14 14:37:36,861 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 106 selfloop transitions, 43 changer transitions 62/256 dead transitions. [2024-10-14 14:37:36,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 256 transitions, 2973 flow [2024-10-14 14:37:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:37:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 14:37:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-10-14 14:37:36,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2024-10-14 14:37:36,864 INFO L175 Difference]: Start difference. First operand has 122 places, 119 transitions, 1175 flow. Second operand 8 states and 220 transitions. [2024-10-14 14:37:36,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 256 transitions, 2973 flow [2024-10-14 14:37:37,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 256 transitions, 2712 flow, removed 93 selfloop flow, removed 9 redundant places. [2024-10-14 14:37:37,032 INFO L231 Difference]: Finished difference. Result has 126 places, 145 transitions, 1552 flow [2024-10-14 14:37:37,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1552, PETRI_PLACES=126, PETRI_TRANSITIONS=145} [2024-10-14 14:37:37,033 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2024-10-14 14:37:37,033 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 145 transitions, 1552 flow [2024-10-14 14:37:37,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:37:37,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:37,035 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:37,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:37:37,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:37,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1948557047, now seen corresponding path program 4 times [2024-10-14 14:37:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760289520] [2024-10-14 14:37:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:37:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760289520] [2024-10-14 14:37:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760289520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:37:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272876278] [2024-10-14 14:37:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:37:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:37:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:37:37,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 38 [2024-10-14 14:37:37,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 145 transitions, 1552 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-10-14 14:37:37,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:37,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 38 [2024-10-14 14:37:37,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:37,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 30#L110-4true, Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,920 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-14 14:37:37,920 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 14:37:37,920 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-14 14:37:37,920 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 36#L70true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 5#L111-3true, 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,962 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 5#L111-3true, 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,962 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 14:37:37,962 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 5#L111-3true, 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,963 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:37:37,963 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:37:37,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 30#L110-4true, Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 36#L70true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,964 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-14 14:37:37,964 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 14:37:37,964 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-14 14:37:37,964 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-14 14:37:37,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([253] L90-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][58], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 4#L111-4true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,988 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:37,988 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:37,988 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,988 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 33#$Ultimate##0true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 36#L70true, 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 4#L111-4true, 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,988 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 33#$Ultimate##0true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 4#L111-4true, 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,989 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 14:37:37,989 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,990 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,990 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([253] L90-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][58], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 24#L92true, Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 4#L111-4true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,990 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:37,990 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:37,990 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 33#$Ultimate##0true, Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, 4#L111-4true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,991 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,991 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,992 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,993 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 36#L70true, 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 5#L111-3true, 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:37,993 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,993 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,993 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-14 14:37:37,993 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 14:37:37,993 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 14:37:38,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([253] L90-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][58], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,019 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,019 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:38,019 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 33#$Ultimate##0true, Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,190 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,190 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,190 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:38,190 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 33#$Ultimate##0true, Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 36#L70true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,191 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,191 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,191 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,191 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:38,192 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([253] L90-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][58], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,196 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,196 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,196 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:38,196 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,196 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,197 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 33#$Ultimate##0true, Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 16#L83true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,197 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,197 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,197 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:38,197 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,197 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,200 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, 33#$Ultimate##0true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 36#L70true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 4#L111-4true, 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,200 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,204 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,204 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:38,204 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,204 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 14:37:38,232 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([234] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} OutVars{thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_3} AuxVars[] AssignedVars[][6], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 18#L112true, Black: 475#true, 33#$Ultimate##0true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 36#L70true, 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), 27#L46true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0)))]) [2024-10-14 14:37:38,232 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,232 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-14 14:37:38,232 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,232 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 14:37:38,232 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:38,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L83-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork0_~lv_assert~1_5 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~lv_assert~1=v_thread2Thread1of1ForFork0_~lv_assert~1_5} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_1|, thread2Thread1of1ForFork0_~lv_assert~1=v_thread2Thread1of1ForFork0_~lv_assert~1_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][81], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 551#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 62#true, 24#L92true, Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 475#true, 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 693#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 264#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 274#true, Black: 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 717#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 726#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 738#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), 29#L54true, 17#thread2EXITtrue, 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))), 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), 713#true]) [2024-10-14 14:37:38,256 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-14 14:37:38,256 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 14:37:38,257 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:38,257 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:38,306 INFO L124 PetriNetUnfolderBase]: 3968/8421 cut-off events. [2024-10-14 14:37:38,306 INFO L125 PetriNetUnfolderBase]: For 83289/85305 co-relation queries the response was YES. [2024-10-14 14:37:38,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42314 conditions, 8421 events. 3968/8421 cut-off events. For 83289/85305 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 72624 event pairs, 1475 based on Foata normal form. 623/7922 useless extension candidates. Maximal degree in co-relation 40362. Up to 2325 conditions per place. [2024-10-14 14:37:38,406 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 58 selfloop transitions, 6 changer transitions 0/143 dead transitions. [2024-10-14 14:37:38,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 143 transitions, 1641 flow [2024-10-14 14:37:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:37:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:37:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-14 14:37:38,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2024-10-14 14:37:38,408 INFO L175 Difference]: Start difference. First operand has 126 places, 145 transitions, 1552 flow. Second operand 4 states and 108 transitions. [2024-10-14 14:37:38,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 143 transitions, 1641 flow [2024-10-14 14:37:38,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 143 transitions, 1577 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-10-14 14:37:38,507 INFO L231 Difference]: Finished difference. Result has 120 places, 131 transitions, 1398 flow [2024-10-14 14:37:38,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1398, PETRI_PLACES=120, PETRI_TRANSITIONS=131} [2024-10-14 14:37:38,508 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 80 predicate places. [2024-10-14 14:37:38,508 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 131 transitions, 1398 flow [2024-10-14 14:37:38,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-10-14 14:37:38,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:38,509 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:37:38,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1177841557, now seen corresponding path program 2 times [2024-10-14 14:37:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221916443] [2024-10-14 14:37:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:37:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221916443] [2024-10-14 14:37:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221916443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:37:38,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:37:38,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:37:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720828233] [2024-10-14 14:37:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:37:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:37:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:37:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:37:38,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 38 [2024-10-14 14:37:38,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 131 transitions, 1398 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-14 14:37:38,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:38,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 38 [2024-10-14 14:37:38,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:39,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset][108], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 475#true, 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 738#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 4#L111-4true, 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), 743#(= (* (div ~d2~0 256) 256) ~d2~0), Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 35#L81true, 13#thread1EXITtrue, Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))), 713#true]) [2024-10-14 14:37:39,706 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L81-->L83: Formula: (= (ite (= (mod v_~v_assert~0_3 256) 0) 0 1) v_thread2Thread1of1ForFork0_~lv_assert~1_7) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3, thread2Thread1of1ForFork0_~lv_assert~1=v_thread2Thread1of1ForFork0_~lv_assert~1_7} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~lv_assert~1][85], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 738#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 16#L83true, 4#L111-4true, 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), 475#true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 743#(= (* (div ~d2~0 256) 256) ~d2~0), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))), 713#true]) [2024-10-14 14:37:39,706 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 14:37:39,706 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-14 14:37:39,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork2_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, thread1Thread1of1ForFork2_~lv_assert~0=v_thread1Thread1of1ForFork2_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset][108], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 18#L112true, Black: 475#true, 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 738#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), 743#(= (* (div ~d2~0 256) 256) ~d2~0), Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 35#L81true, 13#thread1EXITtrue, Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))), 713#true]) [2024-10-14 14:37:39,718 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L81-->L83: Formula: (= (ite (= (mod v_~v_assert~0_3 256) 0) 0 1) v_thread2Thread1of1ForFork0_~lv_assert~1_7) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3, thread2Thread1of1ForFork0_~lv_assert~1=v_thread2Thread1of1ForFork0_~lv_assert~1_7} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~lv_assert~1][85], [Black: 667#(and (= ~pos~0 0) (= ~v_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 677#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), 24#L92true, Black: 64#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 18#L112true, Black: 585#(< 0 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)), 247#(or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0) (= (mod thread1Thread1of1ForFork2_~lv_assert~0 256) 0)), Black: 689#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), Black: 69#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 685#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 669#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 260#(and (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0)) (<= 1 (mod thread1Thread1of1ForFork2_~lv_assert~0 256))), Black: 133#(= thread1Thread1of1ForFork2_~lv_assert~0 1), Black: 266#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (or (= (mod ~d1~0 256) 0) (< (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 89#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= (mod ~d1~0 256) 1)), Black: 258#(and (= (mod ~v_assert~0 256) 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 460#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 277#(and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0))), Black: 462#(and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 332#(= thread2Thread1of1ForFork0_~lv_assert~1 1), Black: 722#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 464#(and (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))) (or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= thread1Thread1of1ForFork2_~lv_assert~0 0)) (and (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= thread2Thread1of1ForFork0_~lv_assert~1 1)))), Black: 720#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 728#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), Black: 724#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0) (= thread1Thread1of1ForFork2_~lv_assert~0 1)), 8#L59true, 738#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 737#(= (* 256 (div ~d1~0 256)) ~d1~0), 16#L83true, 297#(or (and (= thread2Thread1of1ForFork0_~lv_assert~1 0) (= (mod ~v_assert~0 256) 0)) (and (= thread2Thread1of1ForFork0_~lv_assert~1 1) (not (= (mod ~v_assert~0 256) 0)))), 475#true, Black: 691#(and (or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (or (= (mod ~d1~0 256) 0) (< 0 (+ ~pos~0 1)))), 743#(= (* (div ~d2~0 256) 256) ~d2~0), Black: 675#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1)), Black: 665#(and (= ~pos~0 0) (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (= ~d1~0 1)), Black: 53#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 683#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256))), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= thread2Thread1of1ForFork0_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 681#(and (= ~v_assert~0 1) (= thread1Thread1of1ForFork2_~lv_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork0_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 599#(or (< 0 (mod thread1Thread1of1ForFork2_~lv_assert~0 256)) (not (= (mod ~v_assert~0 256) 0))), 713#true]) [2024-10-14 14:37:39,718 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-14 14:37:39,718 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-14 14:37:39,751 INFO L124 PetriNetUnfolderBase]: 4315/8827 cut-off events. [2024-10-14 14:37:39,751 INFO L125 PetriNetUnfolderBase]: For 74790/76150 co-relation queries the response was YES. [2024-10-14 14:37:39,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42564 conditions, 8827 events. 4315/8827 cut-off events. For 74790/76150 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 73666 event pairs, 1624 based on Foata normal form. 300/8234 useless extension candidates. Maximal degree in co-relation 30207. Up to 2929 conditions per place. [2024-10-14 14:37:39,830 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 62 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2024-10-14 14:37:39,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 144 transitions, 1620 flow [2024-10-14 14:37:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:37:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:37:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-14 14:37:39,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2024-10-14 14:37:39,831 INFO L175 Difference]: Start difference. First operand has 120 places, 131 transitions, 1398 flow. Second operand 4 states and 108 transitions. [2024-10-14 14:37:39,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 144 transitions, 1620 flow [2024-10-14 14:37:39,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 144 transitions, 1584 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-10-14 14:37:39,887 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 1231 flow [2024-10-14 14:37:39,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1231, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2024-10-14 14:37:39,889 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-10-14 14:37:39,889 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 1231 flow [2024-10-14 14:37:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-14 14:37:39,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:39,890 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:39,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:37:39,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:39,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 438297774, now seen corresponding path program 1 times [2024-10-14 14:37:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944429556] [2024-10-14 14:37:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944429556] [2024-10-14 14:37:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944429556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:37:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324337775] [2024-10-14 14:37:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:40,247 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-10-14 14:37:40,249 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-10-14 14:37:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:40,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 14:37:40,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:37:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:40,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:37:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324337775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:37:40,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:37:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 18 [2024-10-14 14:37:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461814727] [2024-10-14 14:37:40,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:37:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 14:37:40,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 14:37:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:37:40,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-10-14 14:37:40,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 1231 flow. Second operand has 19 states, 19 states have (on average 13.421052631578947) internal successors, (255), 19 states have internal predecessors, (255), 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-10-14 14:37:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-10-14 14:37:40,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:45,040 INFO L124 PetriNetUnfolderBase]: 18320/30720 cut-off events. [2024-10-14 14:37:45,041 INFO L125 PetriNetUnfolderBase]: For 266512/266512 co-relation queries the response was YES. [2024-10-14 14:37:45,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156201 conditions, 30720 events. 18320/30720 cut-off events. For 266512/266512 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 231568 event pairs, 2502 based on Foata normal form. 804/31503 useless extension candidates. Maximal degree in co-relation 146875. Up to 8031 conditions per place. [2024-10-14 14:37:45,315 INFO L140 encePairwiseOnDemand]: 22/38 looper letters, 218 selfloop transitions, 111 changer transitions 183/521 dead transitions. [2024-10-14 14:37:45,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 521 transitions, 5980 flow [2024-10-14 14:37:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 14:37:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-10-14 14:37:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 650 transitions. [2024-10-14 14:37:45,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5030959752321982 [2024-10-14 14:37:45,318 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 1231 flow. Second operand 34 states and 650 transitions. [2024-10-14 14:37:45,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 521 transitions, 5980 flow [2024-10-14 14:37:45,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 521 transitions, 5972 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 14:37:45,522 INFO L231 Difference]: Finished difference. Result has 167 places, 169 transitions, 2253 flow [2024-10-14 14:37:45,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2253, PETRI_PLACES=167, PETRI_TRANSITIONS=169} [2024-10-14 14:37:45,523 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2024-10-14 14:37:45,523 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 169 transitions, 2253 flow [2024-10-14 14:37:45,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.421052631578947) internal successors, (255), 19 states have internal predecessors, (255), 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-10-14 14:37:45,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:37:45,524 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:37:45,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 14:37:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:45,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-14 14:37:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:37:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1987540804, now seen corresponding path program 2 times [2024-10-14 14:37:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:37:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038900635] [2024-10-14 14:37:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:37:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:37:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:37:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:37:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038900635] [2024-10-14 14:37:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038900635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:37:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542885781] [2024-10-14 14:37:45,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:37:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:37:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:37:45,961 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-10-14 14:37:45,962 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-10-14 14:37:46,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:37:46,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:37:46,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 14:37:46,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:37:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:46,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:37:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:37:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542885781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:37:46,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:37:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2024-10-14 14:37:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421060991] [2024-10-14 14:37:46,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:37:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 14:37:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:37:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 14:37:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:37:46,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-10-14 14:37:46,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 169 transitions, 2253 flow. Second operand has 15 states, 15 states have (on average 15.266666666666667) internal successors, (229), 15 states have internal predecessors, (229), 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-10-14 14:37:46,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:37:46,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-10-14 14:37:46,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:37:48,324 INFO L124 PetriNetUnfolderBase]: 6159/11445 cut-off events. [2024-10-14 14:37:48,324 INFO L125 PetriNetUnfolderBase]: For 156140/156502 co-relation queries the response was YES. [2024-10-14 14:37:48,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63583 conditions, 11445 events. 6159/11445 cut-off events. For 156140/156502 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 85043 event pairs, 826 based on Foata normal form. 546/11716 useless extension candidates. Maximal degree in co-relation 62815. Up to 2763 conditions per place. [2024-10-14 14:37:48,401 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 0 selfloop transitions, 0 changer transitions 340/340 dead transitions. [2024-10-14 14:37:48,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 340 transitions, 4733 flow [2024-10-14 14:37:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 14:37:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-14 14:37:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 274 transitions. [2024-10-14 14:37:48,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5150375939849624 [2024-10-14 14:37:48,403 INFO L175 Difference]: Start difference. First operand has 167 places, 169 transitions, 2253 flow. Second operand 14 states and 274 transitions. [2024-10-14 14:37:48,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 340 transitions, 4733 flow [2024-10-14 14:37:48,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 340 transitions, 4243 flow, removed 141 selfloop flow, removed 20 redundant places. [2024-10-14 14:37:48,719 INFO L231 Difference]: Finished difference. Result has 144 places, 0 transitions, 0 flow [2024-10-14 14:37:48,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=144, PETRI_TRANSITIONS=0} [2024-10-14 14:37:48,720 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-10-14 14:37:48,720 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 0 transitions, 0 flow [2024-10-14 14:37:48,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.266666666666667) internal successors, (229), 15 states have internal predecessors, (229), 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-10-14 14:37:48,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-14 14:37:48,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-10-14 14:37:48,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-14 14:37:48,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-14 14:37:48,736 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-10-14 14:37:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 14:37:48,924 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1] [2024-10-14 14:37:48,928 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:37:48,928 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:37:48,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:37:48 BasicIcfg [2024-10-14 14:37:48,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:37:48,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:37:48,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:37:48,933 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:37:48,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:22" (3/4) ... [2024-10-14 14:37:48,935 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 14:37:48,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 14:37:48,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 14:37:48,939 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 14:37:48,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2024-10-14 14:37:48,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-14 14:37:48,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 14:37:48,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 14:37:49,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:37:49,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 14:37:49,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:37:49,027 INFO L158 Benchmark]: Toolchain (without parser) took 27943.42ms. Allocated memory was 176.2MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 119.6MB in the beginning and 9.6GB in the end (delta: -9.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-14 14:37:49,027 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:37:49,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.06ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 106.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 14:37:49,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 104.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:37:49,028 INFO L158 Benchmark]: Boogie Preprocessor took 35.62ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:37:49,029 INFO L158 Benchmark]: RCFGBuilder took 553.58ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 135.2MB in the end (delta: -32.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-14 14:37:49,029 INFO L158 Benchmark]: TraceAbstraction took 26928.96ms. Allocated memory was 176.2MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 135.2MB in the beginning and 9.7GB in the end (delta: -9.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-14 14:37:49,029 INFO L158 Benchmark]: Witness Printer took 94.27ms. Allocated memory is still 11.0GB. Free memory was 9.7GB in the beginning and 9.6GB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:37:49,030 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.06ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 106.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 104.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.62ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.58ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 135.2MB in the end (delta: -32.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26928.96ms. Allocated memory was 176.2MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 135.2MB in the beginning and 9.7GB in the end (delta: -9.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 94.27ms. Allocated memory is still 11.0GB. Free memory was 9.7GB in the beginning and 9.6GB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 116]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 60 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.8s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1319 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 31 mSDtfsCounter, 2558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 299 SyntacticMatches, 16 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2253occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 3197 SizeOfPredicates, 24 NumberOfNonLiveVariables, 774 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 87/166 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 14:37:49,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE