./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:18:36,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:18:36,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:18:36,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:18:36,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:18:36,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:18:36,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:18:36,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:18:36,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:18:36,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:18:36,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:18:36,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:18:36,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:18:36,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:18:36,757 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:18:36,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:18:36,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:18:36,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:18:36,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:18:36,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:18:36,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:18:36,759 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:18:36,761 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:18:36,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:18:36,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:18:36,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:18:36,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:18:36,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:18:36,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:18:36,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:18:36,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:18:36,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:18:36,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:18:36,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:18:36,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:18:36,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:18:36,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:18:36,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:18:36,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:18:36,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:18:36,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:18:36,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:18:36,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2024-10-24 19:18:37,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:18:37,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:18:37,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:18:37,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:18:37,077 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:18:37,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-24 19:18:38,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:18:38,705 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:18:38,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-24 19:18:38,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00306cfcf/1bd205ba5cf04a098e9babc0628ed71d/FLAGfdaf33b7a [2024-10-24 19:18:39,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00306cfcf/1bd205ba5cf04a098e9babc0628ed71d [2024-10-24 19:18:39,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:18:39,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:18:39,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:18:39,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:18:39,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:18:39,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad08da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39, skipping insertion in model container [2024-10-24 19:18:39,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:18:39,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:18:39,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:18:39,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:18:39,374 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:18:39,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39 WrapperNode [2024-10-24 19:18:39,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:18:39,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:18:39,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:18:39,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:18:39,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,407 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-10-24 19:18:39,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:18:39,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:18:39,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:18:39,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:18:39,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,434 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-24 19:18:39,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:18:39,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:18:39,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:18:39,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:18:39,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (1/1) ... [2024-10-24 19:18:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:18:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:18:39,489 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-24 19:18:39,491 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-24 19:18:39,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:18:39,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 19:18:39,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 19:18:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 19:18:39,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 19:18:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 19:18:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 19:18:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:18:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:18:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:18:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:18:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:18:39,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-24 19:18:39,615 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:18:39,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:18:39,821 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:18:39,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:18:39,957 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:18:39,958 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 19:18:39,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:18:39 BoogieIcfgContainer [2024-10-24 19:18:39,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:18:39,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:18:39,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:18:39,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:18:39,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:18:39" (1/3) ... [2024-10-24 19:18:39,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cf2ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:18:39, skipping insertion in model container [2024-10-24 19:18:39,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:18:39" (2/3) ... [2024-10-24 19:18:39,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cf2ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:18:39, skipping insertion in model container [2024-10-24 19:18:39,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:18:39" (3/3) ... [2024-10-24 19:18:39,969 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2024-10-24 19:18:39,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:18:39,989 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 19:18:39,989 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:18:40,056 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 19:18:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 105 flow [2024-10-24 19:18:40,157 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-10-24 19:18:40,157 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 19:18:40,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 6/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-24 19:18:40,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 42 transitions, 105 flow [2024-10-24 19:18:40,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 38 transitions, 94 flow [2024-10-24 19:18:40,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:18:40,181 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5536189d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:18:40,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-24 19:18:40,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:18:40,194 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-10-24 19:18:40,194 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 19:18:40,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:40,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:18:40,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1510711196, now seen corresponding path program 1 times [2024-10-24 19:18:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849319675] [2024-10-24 19:18:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:40,479 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-24 19:18:40,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:40,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849319675] [2024-10-24 19:18:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849319675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:18:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198413368] [2024-10-24 19:18:40,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:40,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:18:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:18:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:18:40,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 19:18:40,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-24 19:18:40,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:40,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 19:18:40,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:40,800 INFO L124 PetriNetUnfolderBase]: 872/1394 cut-off events. [2024-10-24 19:18:40,801 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-24 19:18:40,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 1394 events. 872/1394 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6639 event pairs, 86 based on Foata normal form. 2/1237 useless extension candidates. Maximal degree in co-relation 2294. Up to 1025 conditions per place. [2024-10-24 19:18:40,820 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 32 selfloop transitions, 7 changer transitions 1/53 dead transitions. [2024-10-24 19:18:40,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 219 flow [2024-10-24 19:18:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:18:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:18:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-24 19:18:40,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-24 19:18:40,835 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 94 flow. Second operand 3 states and 93 transitions. [2024-10-24 19:18:40,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 219 flow [2024-10-24 19:18:40,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 197 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:18:40,845 INFO L231 Difference]: Finished difference. Result has 37 places, 42 transitions, 125 flow [2024-10-24 19:18:40,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=42} [2024-10-24 19:18:40,852 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2024-10-24 19:18:40,853 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 42 transitions, 125 flow [2024-10-24 19:18:40,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-24 19:18:40,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:40,854 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] [2024-10-24 19:18:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:18:40,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:40,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash -679368378, now seen corresponding path program 1 times [2024-10-24 19:18:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831500159] [2024-10-24 19:18:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:18:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831500159] [2024-10-24 19:18:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831500159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:18:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4816858] [2024-10-24 19:18:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:41,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:18:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:18:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:18:41,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-24 19:18:41,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 42 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-24 19:18:41,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:41,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-24 19:18:41,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:41,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][28], [25#thread3EXITtrue, 8#L72true, Black: 51#(= ~pos~0 0), 49#true, 6#L121-4true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-24 19:18:41,185 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,185 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][27], [25#thread3EXITtrue, 8#L72true, Black: 51#(= ~pos~0 0), 49#true, 6#L121-4true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-24 19:18:41,186 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-24 19:18:41,186 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:18:41,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][28], [25#thread3EXITtrue, 8#L72true, 18#L122true, Black: 51#(= ~pos~0 0), 49#true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-24 19:18:41,196 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,196 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,197 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-24 19:18:41,197 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][27], [25#thread3EXITtrue, 8#L72true, 18#L122true, Black: 51#(= ~pos~0 0), 49#true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-24 19:18:41,198 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,198 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,198 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-24 19:18:41,198 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:18:41,229 INFO L124 PetriNetUnfolderBase]: 698/1163 cut-off events. [2024-10-24 19:18:41,230 INFO L125 PetriNetUnfolderBase]: For 244/346 co-relation queries the response was YES. [2024-10-24 19:18:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 1163 events. 698/1163 cut-off events. For 244/346 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5670 event pairs, 79 based on Foata normal form. 45/1028 useless extension candidates. Maximal degree in co-relation 1075. Up to 466 conditions per place. [2024-10-24 19:18:41,245 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-24 19:18:41,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 217 flow [2024-10-24 19:18:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:18:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:18:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-24 19:18:41,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2024-10-24 19:18:41,247 INFO L175 Difference]: Start difference. First operand has 37 places, 42 transitions, 125 flow. Second operand 3 states and 94 transitions. [2024-10-24 19:18:41,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 217 flow [2024-10-24 19:18:41,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 208 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-24 19:18:41,252 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 128 flow [2024-10-24 19:18:41,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2024-10-24 19:18:41,254 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-10-24 19:18:41,254 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 128 flow [2024-10-24 19:18:41,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-24 19:18:41,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:41,255 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] [2024-10-24 19:18:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:18:41,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 418230308, now seen corresponding path program 1 times [2024-10-24 19:18:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364970638] [2024-10-24 19:18:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:18:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364970638] [2024-10-24 19:18:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364970638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:18:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144352782] [2024-10-24 19:18:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:18:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:18:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:18:41,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-24 19:18:41,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:41,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:41,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-24 19:18:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:41,558 INFO L124 PetriNetUnfolderBase]: 801/1278 cut-off events. [2024-10-24 19:18:41,558 INFO L125 PetriNetUnfolderBase]: For 480/702 co-relation queries the response was YES. [2024-10-24 19:18:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1278 events. 801/1278 cut-off events. For 480/702 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6205 event pairs, 101 based on Foata normal form. 46/1093 useless extension candidates. Maximal degree in co-relation 955. Up to 631 conditions per place. [2024-10-24 19:18:41,571 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-24 19:18:41,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 237 flow [2024-10-24 19:18:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:18:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:18:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-10-24 19:18:41,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2024-10-24 19:18:41,573 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 128 flow. Second operand 3 states and 95 transitions. [2024-10-24 19:18:41,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 237 flow [2024-10-24 19:18:41,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:18:41,575 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 138 flow [2024-10-24 19:18:41,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2024-10-24 19:18:41,578 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2024-10-24 19:18:41,578 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 138 flow [2024-10-24 19:18:41,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:41,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:41,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:18:41,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:18:41,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:41,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1654943644, now seen corresponding path program 1 times [2024-10-24 19:18:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358225170] [2024-10-24 19:18:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:18:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358225170] [2024-10-24 19:18:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358225170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:18:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491111661] [2024-10-24 19:18:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:41,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:18:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:18:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:18:41,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-24 19:18:41,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:41,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:41,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-24 19:18:41,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:41,889 INFO L124 PetriNetUnfolderBase]: 912/1477 cut-off events. [2024-10-24 19:18:41,889 INFO L125 PetriNetUnfolderBase]: For 618/830 co-relation queries the response was YES. [2024-10-24 19:18:41,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 1477 events. 912/1477 cut-off events. For 618/830 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7305 event pairs, 182 based on Foata normal form. 48/1246 useless extension candidates. Maximal degree in co-relation 1141. Up to 561 conditions per place. [2024-10-24 19:18:41,903 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-24 19:18:41,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 251 flow [2024-10-24 19:18:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:18:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:18:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-24 19:18:41,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-24 19:18:41,906 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 138 flow. Second operand 3 states and 93 transitions. [2024-10-24 19:18:41,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 251 flow [2024-10-24 19:18:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:18:41,910 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 148 flow [2024-10-24 19:18:41,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2024-10-24 19:18:41,911 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-10-24 19:18:41,912 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 148 flow [2024-10-24 19:18:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:41,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:41,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:18:41,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:18:41,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 18421174, now seen corresponding path program 1 times [2024-10-24 19:18:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425746519] [2024-10-24 19:18:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 19:18:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:42,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425746519] [2024-10-24 19:18:42,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425746519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:42,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:42,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:18:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697720960] [2024-10-24 19:18:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:42,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:18:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:18:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:18:42,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2024-10-24 19:18:42,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 148 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-24 19:18:42,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:42,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2024-10-24 19:18:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:42,549 INFO L124 PetriNetUnfolderBase]: 2153/3269 cut-off events. [2024-10-24 19:18:42,550 INFO L125 PetriNetUnfolderBase]: For 1697/1813 co-relation queries the response was YES. [2024-10-24 19:18:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8278 conditions, 3269 events. 2153/3269 cut-off events. For 1697/1813 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17266 event pairs, 401 based on Foata normal form. 65/2877 useless extension candidates. Maximal degree in co-relation 3488. Up to 1150 conditions per place. [2024-10-24 19:18:42,580 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 50 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-10-24 19:18:42,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 354 flow [2024-10-24 19:18:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:18:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:18:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-10-24 19:18:42,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-24 19:18:42,586 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 148 flow. Second operand 4 states and 124 transitions. [2024-10-24 19:18:42,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 354 flow [2024-10-24 19:18:42,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:18:42,589 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 178 flow [2024-10-24 19:18:42,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-10-24 19:18:42,592 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2024-10-24 19:18:42,592 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 178 flow [2024-10-24 19:18:42,593 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-24 19:18:42,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:42,593 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:18:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:18:42,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash -784589418, now seen corresponding path program 1 times [2024-10-24 19:18:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074432269] [2024-10-24 19:18:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:18:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:42,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074432269] [2024-10-24 19:18:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074432269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:18:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:18:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:18:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687955735] [2024-10-24 19:18:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:18:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:18:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:18:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:18:42,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2024-10-24 19:18:42,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 178 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-24 19:18:42,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:42,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2024-10-24 19:18:42,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:43,344 INFO L124 PetriNetUnfolderBase]: 3423/5060 cut-off events. [2024-10-24 19:18:43,345 INFO L125 PetriNetUnfolderBase]: For 6689/7414 co-relation queries the response was YES. [2024-10-24 19:18:43,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14582 conditions, 5060 events. 3423/5060 cut-off events. For 6689/7414 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28126 event pairs, 791 based on Foata normal form. 188/4271 useless extension candidates. Maximal degree in co-relation 5151. Up to 1747 conditions per place. [2024-10-24 19:18:43,461 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 54 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-10-24 19:18:43,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 432 flow [2024-10-24 19:18:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:18:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:18:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-10-24 19:18:43,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2024-10-24 19:18:43,463 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 178 flow. Second operand 4 states and 122 transitions. [2024-10-24 19:18:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 432 flow [2024-10-24 19:18:43,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 426 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-24 19:18:43,468 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 208 flow [2024-10-24 19:18:43,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-24 19:18:43,469 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-10-24 19:18:43,469 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 208 flow [2024-10-24 19:18:43,470 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-24 19:18:43,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:43,470 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-10-24 19:18:43,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:18:43,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash -298864946, now seen corresponding path program 1 times [2024-10-24 19:18:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986763591] [2024-10-24 19:18:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 19:18:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986763591] [2024-10-24 19:18:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986763591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:18:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154022638] [2024-10-24 19:18:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:18:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:18:43,712 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-24 19:18:43,713 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-24 19:18:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:43,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:18:43,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:18:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 19:18:44,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:18:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 19:18:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154022638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:18:44,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:18:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 7] total 12 [2024-10-24 19:18:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843091558] [2024-10-24 19:18:44,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:18:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 19:18:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 19:18:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:18:44,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-10-24 19:18:44,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 208 flow. Second operand has 13 states, 13 states have (on average 19.53846153846154) internal successors, (254), 13 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:44,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:44,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-10-24 19:18:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:46,798 INFO L124 PetriNetUnfolderBase]: 12044/17054 cut-off events. [2024-10-24 19:18:46,799 INFO L125 PetriNetUnfolderBase]: For 24861/26968 co-relation queries the response was YES. [2024-10-24 19:18:46,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52543 conditions, 17054 events. 12044/17054 cut-off events. For 24861/26968 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 98737 event pairs, 1305 based on Foata normal form. 1490/16807 useless extension candidates. Maximal degree in co-relation 18641. Up to 4101 conditions per place. [2024-10-24 19:18:47,001 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 240 selfloop transitions, 77 changer transitions 0/331 dead transitions. [2024-10-24 19:18:47,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 331 transitions, 2143 flow [2024-10-24 19:18:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 19:18:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-24 19:18:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 583 transitions. [2024-10-24 19:18:47,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2024-10-24 19:18:47,005 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 208 flow. Second operand 22 states and 583 transitions. [2024-10-24 19:18:47,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 331 transitions, 2143 flow [2024-10-24 19:18:47,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 331 transitions, 2131 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-24 19:18:47,024 INFO L231 Difference]: Finished difference. Result has 91 places, 121 transitions, 889 flow [2024-10-24 19:18:47,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=889, PETRI_PLACES=91, PETRI_TRANSITIONS=121} [2024-10-24 19:18:47,025 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-10-24 19:18:47,025 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 121 transitions, 889 flow [2024-10-24 19:18:47,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.53846153846154) internal successors, (254), 13 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:18:47,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:47,026 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, 1, 1] [2024-10-24 19:18:47,049 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-24 19:18:47,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:18:47,232 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:47,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2137944576, now seen corresponding path program 1 times [2024-10-24 19:18:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:47,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68662449] [2024-10-24 19:18:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:18:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68662449] [2024-10-24 19:18:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68662449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:18:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111145650] [2024-10-24 19:18:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:18:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:18:47,450 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-24 19:18:47,451 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-24 19:18:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:47,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:18:47,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:18:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:18:47,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:18:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:18:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111145650] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:18:47,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:18:47,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-24 19:18:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462975856] [2024-10-24 19:18:47,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:18:47,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:18:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:47,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:18:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:18:47,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 19:18:47,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 121 transitions, 889 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-24 19:18:47,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:47,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 19:18:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:18:53,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][124], [Black: 63#(= ~g3~0 1), 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:53,610 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:18:53,610 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:18:53,610 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:18:53,610 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:18:54,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][124], [Black: 63#(= ~g3~0 1), 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:54,066 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 19:18:54,066 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:18:54,067 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:18:54,067 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:18:56,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,476 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2024-10-24 19:18:56,476 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 19:18:56,476 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 19:18:56,476 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 19:18:56,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,480 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-10-24 19:18:56,480 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,480 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,480 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 360#(= ~pos~0 2), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,484 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-10-24 19:18:56,484 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,484 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,484 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:18:56,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,491 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-10-24 19:18:56,491 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 19:18:56,491 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 19:18:56,491 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 19:18:56,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,499 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-10-24 19:18:56,499 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-24 19:18:56,499 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-24 19:18:56,499 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-24 19:18:56,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,504 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-24 19:18:56,504 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,504 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,504 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,506 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-24 19:18:56,506 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,506 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,506 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:18:56,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,517 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2024-10-24 19:18:56,517 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:18:56,517 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:18:56,517 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:18:56,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,526 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is cut-off event [2024-10-24 19:18:56,526 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 19:18:56,526 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 19:18:56,526 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 19:18:56,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:18:56,527 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2024-10-24 19:18:56,527 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-24 19:18:56,528 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-24 19:18:56,528 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-24 19:18:56,533 INFO L124 PetriNetUnfolderBase]: 45115/72593 cut-off events. [2024-10-24 19:18:56,533 INFO L125 PetriNetUnfolderBase]: For 286569/291863 co-relation queries the response was YES. [2024-10-24 19:18:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284268 conditions, 72593 events. 45115/72593 cut-off events. For 286569/291863 co-relation queries the response was YES. Maximal size of possible extension queue 2043. Compared 600149 event pairs, 4951 based on Foata normal form. 1887/72930 useless extension candidates. Maximal degree in co-relation 223676. Up to 22231 conditions per place. [2024-10-24 19:18:57,386 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 383 selfloop transitions, 34 changer transitions 1/463 dead transitions. [2024-10-24 19:18:57,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 463 transitions, 4493 flow [2024-10-24 19:18:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:18:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:18:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2024-10-24 19:18:57,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-24 19:18:57,389 INFO L175 Difference]: Start difference. First operand has 91 places, 121 transitions, 889 flow. Second operand 7 states and 245 transitions. [2024-10-24 19:18:57,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 463 transitions, 4493 flow [2024-10-24 19:18:58,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 463 transitions, 4201 flow, removed 146 selfloop flow, removed 0 redundant places. [2024-10-24 19:18:58,609 INFO L231 Difference]: Finished difference. Result has 98 places, 151 transitions, 1052 flow [2024-10-24 19:18:58,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=98, PETRI_TRANSITIONS=151} [2024-10-24 19:18:58,610 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-10-24 19:18:58,612 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 151 transitions, 1052 flow [2024-10-24 19:18:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-24 19:18:58,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:18:58,613 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, 1, 1] [2024-10-24 19:18:58,630 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-24 19:18:58,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-24 19:18:58,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:18:58,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:18:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1970211960, now seen corresponding path program 2 times [2024-10-24 19:18:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:18:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351698076] [2024-10-24 19:18:58,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:18:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:18:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:18:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:18:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:18:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351698076] [2024-10-24 19:18:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351698076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:18:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996958598] [2024-10-24 19:18:59,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:18:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:18:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:18:59,010 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-24 19:18:59,011 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-24 19:18:59,100 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:18:59,100 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:18:59,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:18:59,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:18:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:18:59,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:18:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:18:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996958598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:18:59,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:18:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-24 19:18:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894939283] [2024-10-24 19:18:59,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:18:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:18:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:18:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:18:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:18:59,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 19:18:59,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 151 transitions, 1052 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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-24 19:18:59,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:18:59,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 19:18:59,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:19:08,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:08,230 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 19:19:08,230 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,230 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][299], [Black: 63#(= ~g3~0 1), 608#true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 73#(= ~g3~0 1), 41#L44true, 6#L121-4true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 35#L97-1true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:08,231 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:08,232 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 19:19:08,232 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,232 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:08,232 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:19:09,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,569 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][299], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 73#(= ~g3~0 1), 41#L44true, Black: 51#(= ~pos~0 0), 35#L97-1true, Black: 55#(= ~g2~0 1), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,569 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,570 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,570 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,683 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][299], [Black: 63#(= ~g3~0 1), 608#true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 73#(= ~g3~0 1), 41#L44true, 6#L121-4true, Black: 51#(= ~pos~0 0), 35#L97-1true, Black: 55#(= ~g2~0 1), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,683 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,684 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,684 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:09,685 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 19:19:09,685 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,685 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:09,685 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:19:11,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:11,091 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][299], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 73#(= ~g3~0 1), 41#L44true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 35#L97-1true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:11,091 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,091 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:11,092 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 19:19:11,092 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,092 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:11,092 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:19:12,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:12,214 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:19:12,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:12,781 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:19:12,781 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,781 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,781 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:12,788 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:19:12,788 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,788 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,789 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][457], [Black: 63#(= ~g3~0 1), 608#true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 41#L44true, 6#L121-4true, 71#true, Black: 51#(= ~pos~0 0), 35#L97-1true, Black: 55#(= ~g2~0 1), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:12,789 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:19:12,789 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,789 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,789 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 19:19:12,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:12,944 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 19:19:12,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:12,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:12,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][127], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 356#(= ~pos~0 0), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:14,026 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 19:19:14,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][107], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 321#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:14,034 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 19:19:14,034 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,034 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,034 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L94-->L97-1: Formula: (and (let ((.cse0 (= (mod v_~d3~0_33 256) 0)) (.cse1 (= v_~g3~0_39 v_~g3~0_38))) (or (and (= |v_thread3Thread1of1ForFork1_#t~nondet5_2| |v_thread3Thread1of1ForFork1_#t~nondet5_1|) .cse0 .cse1) (and (not .cse0) (let ((.cse2 (= (mod |v_thread3_#t~nondet5_37| 256) 0))) (or (and .cse2 .cse1) (and (not .cse2) (= v_~g3~0_38 0)))) (or (= |v_thread3_#t~nondet5_37| 0) (= |v_thread3_#t~nondet5_37| 1))))) (= (ite (= (ite (= (mod v_~d3~0_34 256) 0) 1 0) 0) 0 1) v_~d3~0_33)) InVars {thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_1|, ~g3~0=v_~g3~0_39, ~d3~0=v_~d3~0_34} OutVars{thread3Thread1of1ForFork1_#t~nondet5=|v_thread3Thread1of1ForFork1_#t~nondet5_2|, ~g3~0=v_~g3~0_38, ~d3~0=v_~d3~0_33} AuxVars[|v_thread3_#t~nondet5_37|] AssignedVars[thread3Thread1of1ForFork1_#t~nondet5, ~g3~0, ~d3~0][457], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 41#L44true, 71#true, Black: 51#(= ~pos~0 0), 35#L97-1true, Black: 55#(= ~g2~0 1), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:14,035 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 19:19:14,035 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,035 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:14,035 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:19,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 356#(= ~pos~0 0), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,173 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-10-24 19:19:19,173 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:19,173 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:19:19,173 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:19,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 356#(= ~pos~0 0), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,686 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-10-24 19:19:19,686 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 19:19:19,686 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 19:19:19,686 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 19:19:19,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 356#(= ~pos~0 0), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,863 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-10-24 19:19:19,863 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-24 19:19:19,863 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-10-24 19:19:19,863 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-24 19:19:19,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 65#true, Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 356#(= ~pos~0 0), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,910 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-10-24 19:19:19,910 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2024-10-24 19:19:19,911 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,911 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 356#(= ~pos~0 0), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,912 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-10-24 19:19:19,912 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,912 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,912 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][204], [Black: 63#(= ~g3~0 1), 608#true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 360#(= ~pos~0 2), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,932 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-10-24 19:19:19,932 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 19:19:19,933 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:19:19,933 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 19:19:19,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 65#true, Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 356#(= ~pos~0 0), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), 23#L75-1true, Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,958 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2024-10-24 19:19:19,958 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,958 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,958 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 356#(= ~pos~0 0), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,960 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2024-10-24 19:19:19,960 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,960 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,960 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:19,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][204], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 356#(= ~pos~0 0), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 360#(= ~pos~0 2), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:19,965 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2024-10-24 19:19:19,965 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 19:19:19,965 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 19:19:19,965 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 19:19:20,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][306], [Black: 63#(= ~g3~0 1), 608#true, 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), 65#true, Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 19#thread2EXITtrue, Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 356#(= ~pos~0 0), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-24 19:19:20,004 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2024-10-24 19:19:20,004 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 19:19:20,004 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 19:19:20,004 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 19:19:20,093 INFO L124 PetriNetUnfolderBase]: 103544/165347 cut-off events. [2024-10-24 19:19:20,093 INFO L125 PetriNetUnfolderBase]: For 683397/696573 co-relation queries the response was YES. [2024-10-24 19:19:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688039 conditions, 165347 events. 103544/165347 cut-off events. For 683397/696573 co-relation queries the response was YES. Maximal size of possible extension queue 5360. Compared 1514542 event pairs, 11806 based on Foata normal form. 5096/166672 useless extension candidates. Maximal degree in co-relation 528455. Up to 56551 conditions per place. [2024-10-24 19:19:22,772 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 410 selfloop transitions, 58 changer transitions 1/514 dead transitions. [2024-10-24 19:19:22,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 514 transitions, 4704 flow [2024-10-24 19:19:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:19:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:19:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-10-24 19:19:22,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8401360544217688 [2024-10-24 19:19:22,774 INFO L175 Difference]: Start difference. First operand has 98 places, 151 transitions, 1052 flow. Second operand 7 states and 247 transitions. [2024-10-24 19:19:22,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 514 transitions, 4704 flow [2024-10-24 19:19:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 514 transitions, 4548 flow, removed 78 selfloop flow, removed 0 redundant places. [2024-10-24 19:19:27,363 INFO L231 Difference]: Finished difference. Result has 108 places, 205 transitions, 1493 flow [2024-10-24 19:19:27,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1493, PETRI_PLACES=108, PETRI_TRANSITIONS=205} [2024-10-24 19:19:27,365 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-10-24 19:19:27,365 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 205 transitions, 1493 flow [2024-10-24 19:19:27,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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-24 19:19:27,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:19:27,365 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, 1, 1] [2024-10-24 19:19:27,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 19:19:27,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:19:27,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 19:19:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:19:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1284538042, now seen corresponding path program 3 times [2024-10-24 19:19:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:19:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432691983] [2024-10-24 19:19:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:19:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:19:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:19:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:19:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:19:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432691983] [2024-10-24 19:19:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432691983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:19:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706085472] [2024-10-24 19:19:27,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:19:27,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:19:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:19:27,761 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-24 19:19:27,762 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-24 19:19:27,835 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 19:19:27,835 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:19:27,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:19:27,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:19:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:19:27,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:19:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:19:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706085472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:19:27,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:19:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-24 19:19:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300399524] [2024-10-24 19:19:27,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:19:27,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:19:27,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:19:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:19:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:19:27,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-24 19:19:27,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 205 transitions, 1493 flow. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 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-24 19:19:27,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:19:27,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-24 19:19:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand