/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 20:08:45,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 20:08:46,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 20:08:46,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 20:08:46,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 20:08:46,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 20:08:46,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 20:08:46,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 20:08:46,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 20:08:46,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 20:08:46,030 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 20:08:46,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 20:08:46,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 20:08:46,031 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 20:08:46,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 20:08:46,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 20:08:46,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 20:08:46,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 20:08:46,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 20:08:46,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 20:08:46,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 20:08:46,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 20:08:46,034 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 20:08:46,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 20:08:46,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 20:08:46,035 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 20:08:46,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 20:08:46,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:08:46,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 20:08:46,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 20:08:46,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 20:08:46,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 20:08:46,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 20:08:46,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 20:08:46,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 20:08:46,038 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 20:08:46,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 20:08:46,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 20:08:46,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 20:08:46,365 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 20:08:46,365 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 20:08:46,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2023-08-26 20:08:47,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 20:08:47,727 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 20:08:47,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2023-08-26 20:08:47,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272c1d1dc/d0591c11c24a4bb39f129ed37c73f6b5/FLAG2ab814778 [2023-08-26 20:08:47,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272c1d1dc/d0591c11c24a4bb39f129ed37c73f6b5 [2023-08-26 20:08:47,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 20:08:47,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 20:08:47,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 20:08:47,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 20:08:47,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 20:08:47,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:08:47" (1/1) ... [2023-08-26 20:08:47,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2772f3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:47, skipping insertion in model container [2023-08-26 20:08:47,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:08:47" (1/1) ... [2023-08-26 20:08:47,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 20:08:47,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:08:47,980 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 20:08:48,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:08:48,024 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 20:08:48,024 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 20:08:48,031 INFO L206 MainTranslator]: Completed translation [2023-08-26 20:08:48,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48 WrapperNode [2023-08-26 20:08:48,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 20:08:48,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 20:08:48,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 20:08:48,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 20:08:48,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,082 INFO L138 Inliner]: procedures = 23, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 123 [2023-08-26 20:08:48,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 20:08:48,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 20:08:48,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 20:08:48,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 20:08:48,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 20:08:48,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 20:08:48,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 20:08:48,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 20:08:48,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (1/1) ... [2023-08-26 20:08:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:08:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:08:48,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 20:08:48,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 20:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 20:08:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 20:08:48,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 20:08:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 20:08:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 20:08:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 20:08:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 20:08:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 20:08:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 20:08:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 20:08:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 20:08:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 20:08:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 20:08:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 20:08:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 20:08:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 20:08:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 20:08:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 20:08:48,209 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 20:08:48,319 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 20:08:48,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 20:08:48,629 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 20:08:48,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 20:08:48,664 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 20:08:48,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:08:48 BoogieIcfgContainer [2023-08-26 20:08:48,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 20:08:48,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 20:08:48,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 20:08:48,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 20:08:48,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:08:47" (1/3) ... [2023-08-26 20:08:48,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d05df21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:08:48, skipping insertion in model container [2023-08-26 20:08:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:08:48" (2/3) ... [2023-08-26 20:08:48,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d05df21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:08:48, skipping insertion in model container [2023-08-26 20:08:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:08:48" (3/3) ... [2023-08-26 20:08:48,674 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2023-08-26 20:08:48,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 20:08:48,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 20:08:48,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 20:08:48,793 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 20:08:48,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 149 transitions, 330 flow [2023-08-26 20:08:48,881 INFO L124 PetriNetUnfolderBase]: 10/145 cut-off events. [2023-08-26 20:08:48,882 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 20:08:48,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 145 events. 10/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 20:08:48,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 149 transitions, 330 flow [2023-08-26 20:08:48,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 132 transitions, 288 flow [2023-08-26 20:08:48,899 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 20:08:48,912 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 132 transitions, 288 flow [2023-08-26 20:08:48,914 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 132 transitions, 288 flow [2023-08-26 20:08:48,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 132 transitions, 288 flow [2023-08-26 20:08:48,944 INFO L124 PetriNetUnfolderBase]: 10/132 cut-off events. [2023-08-26 20:08:48,945 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 20:08:48,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 10/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 171 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 20:08:48,948 INFO L119 LiptonReduction]: Number of co-enabled transitions 3608 [2023-08-26 20:08:53,035 INFO L134 LiptonReduction]: Checked pairs total: 3776 [2023-08-26 20:08:53,035 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-26 20:08:53,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 20:08:53,053 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4fb7b13c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 20:08:53,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 20:08:53,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 20:08:53,054 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 20:08:53,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 20:08:53,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:53,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 20:08:53,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:53,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 578, now seen corresponding path program 1 times [2023-08-26 20:08:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:53,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931470522] [2023-08-26 20:08:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931470522] [2023-08-26 20:08:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931470522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:53,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 20:08:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120334679] [2023-08-26 20:08:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 20:08:53,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:53,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 20:08:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 20:08:53,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 274 [2023-08-26 20:08:53,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 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) [2023-08-26 20:08:53,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:53,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 274 [2023-08-26 20:08:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:53,573 INFO L124 PetriNetUnfolderBase]: 2524/3163 cut-off events. [2023-08-26 20:08:53,573 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-26 20:08:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 3163 events. 2524/3163 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 11303 event pairs, 1182 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 4966. Up to 3134 conditions per place. [2023-08-26 20:08:53,601 INFO L140 encePairwiseOnDemand]: 272/274 looper letters, 39 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-26 20:08:53,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 188 flow [2023-08-26 20:08:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 20:08:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 20:08:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2023-08-26 20:08:53,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565693430656934 [2023-08-26 20:08:53,622 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2023-08-26 20:08:53,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2023-08-26 20:08:53,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:53,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2023-08-26 20:08:53,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 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) [2023-08-26 20:08:53,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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) [2023-08-26 20:08:53,637 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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) [2023-08-26 20:08:53,639 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 114 flow. Second operand 2 states and 305 transitions. [2023-08-26 20:08:53,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 188 flow [2023-08-26 20:08:53,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 20:08:53,647 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-26 20:08:53,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-26 20:08:53,652 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-26 20:08:53,652 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-26 20:08:53,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 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) [2023-08-26 20:08:53,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:53,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:08:53,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 20:08:53,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:53,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 569910, now seen corresponding path program 1 times [2023-08-26 20:08:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:53,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022523444] [2023-08-26 20:08:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022523444] [2023-08-26 20:08:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022523444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028887624] [2023-08-26 20:08:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:54,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:54,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-08-26 20:08:54,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-08-26 20:08:54,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:54,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-08-26 20:08:54,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:54,314 INFO L124 PetriNetUnfolderBase]: 2413/3022 cut-off events. [2023-08-26 20:08:54,315 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 3022 events. 2413/3022 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10688 event pairs, 1127 based on Foata normal form. 0/1488 useless extension candidates. Maximal degree in co-relation 6054. Up to 2992 conditions per place. [2023-08-26 20:08:54,335 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 36 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 20:08:54,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 164 flow [2023-08-26 20:08:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-26 20:08:54,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306569343065693 [2023-08-26 20:08:54,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-26 20:08:54,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-26 20:08:54,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:54,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-26 20:08:54,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-08-26 20:08:54,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:54,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:54,346 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 354 transitions. [2023-08-26 20:08:54,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 164 flow [2023-08-26 20:08:54,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:08:54,350 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 92 flow [2023-08-26 20:08:54,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-26 20:08:54,352 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-26 20:08:54,352 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 92 flow [2023-08-26 20:08:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-08-26 20:08:54,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:54,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:08:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 20:08:54,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:54,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 569909, now seen corresponding path program 1 times [2023-08-26 20:08:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058085555] [2023-08-26 20:08:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058085555] [2023-08-26 20:08:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058085555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:54,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:54,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565549668] [2023-08-26 20:08:54,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:54,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:54,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:54,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 274 [2023-08-26 20:08:54,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2023-08-26 20:08:54,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:54,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 274 [2023-08-26 20:08:54,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:54,716 INFO L124 PetriNetUnfolderBase]: 2302/2881 cut-off events. [2023-08-26 20:08:54,716 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:54,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 2881 events. 2302/2881 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10034 event pairs, 1072 based on Foata normal form. 0/1433 useless extension candidates. Maximal degree in co-relation 5773. Up to 2851 conditions per place. [2023-08-26 20:08:54,734 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 20:08:54,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 158 flow [2023-08-26 20:08:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-26 20:08:54,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41362530413625304 [2023-08-26 20:08:54,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-26 20:08:54,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-26 20:08:54,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:54,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-26 20:08:54,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-08-26 20:08:54,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:54,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:54,740 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 92 flow. Second operand 3 states and 340 transitions. [2023-08-26 20:08:54,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 158 flow [2023-08-26 20:08:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:54,742 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 89 flow [2023-08-26 20:08:54,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-26 20:08:54,743 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-26 20:08:54,743 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 89 flow [2023-08-26 20:08:54,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2023-08-26 20:08:54,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:54,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:08:54,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 20:08:54,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:54,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:54,747 INFO L85 PathProgramCache]: Analyzing trace with hash 547694944, now seen corresponding path program 1 times [2023-08-26 20:08:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962467007] [2023-08-26 20:08:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962467007] [2023-08-26 20:08:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962467007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975669399] [2023-08-26 20:08:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:54,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-08-26 20:08:54,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2023-08-26 20:08:54,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:54,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-08-26 20:08:54,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:55,042 INFO L124 PetriNetUnfolderBase]: 2256/2817 cut-off events. [2023-08-26 20:08:55,042 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 2817 events. 2256/2817 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9746 event pairs, 1050 based on Foata normal form. 0/1409 useless extension candidates. Maximal degree in co-relation 5646. Up to 2787 conditions per place. [2023-08-26 20:08:55,058 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 20:08:55,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 151 flow [2023-08-26 20:08:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-26 20:08:55,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257907542579075 [2023-08-26 20:08:55,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-26 20:08:55,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-26 20:08:55,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:55,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-26 20:08:55,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-26 20:08:55,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,064 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 89 flow. Second operand 3 states and 350 transitions. [2023-08-26 20:08:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 151 flow [2023-08-26 20:08:55,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:55,066 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 86 flow [2023-08-26 20:08:55,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-26 20:08:55,069 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-26 20:08:55,069 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 86 flow [2023-08-26 20:08:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2023-08-26 20:08:55,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:55,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:08:55,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 20:08:55,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:55,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 547694942, now seen corresponding path program 1 times [2023-08-26 20:08:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937154786] [2023-08-26 20:08:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:55,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937154786] [2023-08-26 20:08:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937154786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848991909] [2023-08-26 20:08:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:55,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 274 [2023-08-26 20:08:55,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2023-08-26 20:08:55,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:55,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 274 [2023-08-26 20:08:55,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:55,360 INFO L124 PetriNetUnfolderBase]: 2210/2753 cut-off events. [2023-08-26 20:08:55,360 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:55,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 2753 events. 2210/2753 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9473 event pairs, 1028 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 5519. Up to 2723 conditions per place. [2023-08-26 20:08:55,373 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 20:08:55,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 144 flow [2023-08-26 20:08:55,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-26 20:08:55,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40875912408759124 [2023-08-26 20:08:55,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-26 20:08:55,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-26 20:08:55,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:55,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-26 20:08:55,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-08-26 20:08:55,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,378 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 86 flow. Second operand 3 states and 336 transitions. [2023-08-26 20:08:55,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 144 flow [2023-08-26 20:08:55,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:55,379 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2023-08-26 20:08:55,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-26 20:08:55,380 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -12 predicate places. [2023-08-26 20:08:55,380 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2023-08-26 20:08:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2023-08-26 20:08:55,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:55,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:08:55,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 20:08:55,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:55,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1946123638, now seen corresponding path program 1 times [2023-08-26 20:08:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884136994] [2023-08-26 20:08:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884136994] [2023-08-26 20:08:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884136994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065985924] [2023-08-26 20:08:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:55,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:55,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-08-26 20:08:55,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2023-08-26 20:08:55,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:55,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-08-26 20:08:55,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:55,601 INFO L124 PetriNetUnfolderBase]: 2107/2620 cut-off events. [2023-08-26 20:08:55,601 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 2620 events. 2107/2620 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8917 event pairs, 981 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 5254. Up to 2590 conditions per place. [2023-08-26 20:08:55,615 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 20:08:55,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 137 flow [2023-08-26 20:08:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-26 20:08:55,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209245742092457 [2023-08-26 20:08:55,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-26 20:08:55,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-26 20:08:55,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:55,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-26 20:08:55,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-08-26 20:08:55,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,621 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 3 states and 346 transitions. [2023-08-26 20:08:55,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 137 flow [2023-08-26 20:08:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:55,622 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 80 flow [2023-08-26 20:08:55,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 20:08:55,623 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2023-08-26 20:08:55,623 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 80 flow [2023-08-26 20:08:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2023-08-26 20:08:55,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:55,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:08:55,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 20:08:55,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:55,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1946123640, now seen corresponding path program 1 times [2023-08-26 20:08:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575945626] [2023-08-26 20:08:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575945626] [2023-08-26 20:08:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575945626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510781809] [2023-08-26 20:08:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:55,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:55,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 274 [2023-08-26 20:08:55,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2023-08-26 20:08:55,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:55,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 274 [2023-08-26 20:08:55,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:55,812 INFO L124 PetriNetUnfolderBase]: 2004/2487 cut-off events. [2023-08-26 20:08:55,812 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 2487 events. 2004/2487 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8362 event pairs, 934 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 4989. Up to 2457 conditions per place. [2023-08-26 20:08:55,825 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 26 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 20:08:55,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 130 flow [2023-08-26 20:08:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-26 20:08:55,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40389294403892945 [2023-08-26 20:08:55,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-26 20:08:55,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-26 20:08:55,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:55,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-26 20:08:55,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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) [2023-08-26 20:08:55,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:55,830 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 80 flow. Second operand 3 states and 332 transitions. [2023-08-26 20:08:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 130 flow [2023-08-26 20:08:55,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:55,831 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 77 flow [2023-08-26 20:08:55,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-26 20:08:55,832 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:08:55,832 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 77 flow [2023-08-26 20:08:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2023-08-26 20:08:55,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:55,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:08:55,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 20:08:55,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:55,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1914029917, now seen corresponding path program 1 times [2023-08-26 20:08:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222392383] [2023-08-26 20:08:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222392383] [2023-08-26 20:08:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222392383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:08:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268824862] [2023-08-26 20:08:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:08:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:08:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:08:55,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 274 [2023-08-26 20:08:55,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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) [2023-08-26 20:08:55,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:55,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 274 [2023-08-26 20:08:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:56,113 INFO L124 PetriNetUnfolderBase]: 1590/1992 cut-off events. [2023-08-26 20:08:56,113 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4004 conditions, 1992 events. 1590/1992 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6557 event pairs, 736 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 4000. Up to 1962 conditions per place. [2023-08-26 20:08:56,121 INFO L140 encePairwiseOnDemand]: 272/274 looper letters, 25 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-26 20:08:56,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 127 flow [2023-08-26 20:08:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-08-26 20:08:56,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686131386861314 [2023-08-26 20:08:56,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-08-26 20:08:56,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-08-26 20:08:56,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:56,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-08-26 20:08:56,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2023-08-26 20:08:56,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,126 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 77 flow. Second operand 3 states and 303 transitions. [2023-08-26 20:08:56,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 127 flow [2023-08-26 20:08:56,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:56,127 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2023-08-26 20:08:56,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 20:08:56,128 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:08:56,128 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2023-08-26 20:08:56,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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) [2023-08-26 20:08:56,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:56,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:08:56,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 20:08:56,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:56,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1914029916, now seen corresponding path program 1 times [2023-08-26 20:08:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519976429] [2023-08-26 20:08:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519976429] [2023-08-26 20:08:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519976429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879024444] [2023-08-26 20:08:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:56,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-08-26 20:08:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2023-08-26 20:08:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-08-26 20:08:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:56,363 INFO L124 PetriNetUnfolderBase]: 1176/1497 cut-off events. [2023-08-26 20:08:56,363 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:08:56,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1497 events. 1176/1497 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4766 event pairs, 538 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 3011. Up to 1467 conditions per place. [2023-08-26 20:08:56,370 INFO L140 encePairwiseOnDemand]: 272/274 looper letters, 24 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 20:08:56,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 124 flow [2023-08-26 20:08:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 20:08:56,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148418491484185 [2023-08-26 20:08:56,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 20:08:56,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 20:08:56,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:56,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 20:08:56,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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) [2023-08-26 20:08:56,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,375 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 3 states and 341 transitions. [2023-08-26 20:08:56,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 124 flow [2023-08-26 20:08:56,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:56,376 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 75 flow [2023-08-26 20:08:56,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-26 20:08:56,376 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:08:56,376 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 75 flow [2023-08-26 20:08:56,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2023-08-26 20:08:56,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:56,377 INFO L208 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] [2023-08-26 20:08:56,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 20:08:56,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:56,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash 665502678, now seen corresponding path program 1 times [2023-08-26 20:08:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754924049] [2023-08-26 20:08:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754924049] [2023-08-26 20:08:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754924049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:08:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541799681] [2023-08-26 20:08:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:56,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:08:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:08:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:08:56,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2023-08-26 20:08:56,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-26 20:08:56,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:56,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2023-08-26 20:08:56,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:56,642 INFO L124 PetriNetUnfolderBase]: 1343/1736 cut-off events. [2023-08-26 20:08:56,642 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 20:08:56,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 1736 events. 1343/1736 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5867 event pairs, 215 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 3512. Up to 1515 conditions per place. [2023-08-26 20:08:56,649 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 39 selfloop transitions, 3 changer transitions 3/49 dead transitions. [2023-08-26 20:08:56,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 212 flow [2023-08-26 20:08:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:08:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:08:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-26 20:08:56,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255474452554745 [2023-08-26 20:08:56,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-26 20:08:56,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-26 20:08:56,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:56,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-26 20:08:56,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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) [2023-08-26 20:08:56,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2023-08-26 20:08:56,654 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 75 flow. Second operand 3 states and 432 transitions. [2023-08-26 20:08:56,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 212 flow [2023-08-26 20:08:56,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:56,656 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 97 flow [2023-08-26 20:08:56,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 20:08:56,657 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -12 predicate places. [2023-08-26 20:08:56,657 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 97 flow [2023-08-26 20:08:56,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-26 20:08:56,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:56,657 INFO L208 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] [2023-08-26 20:08:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 20:08:56,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:56,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash -889511879, now seen corresponding path program 1 times [2023-08-26 20:08:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368864333] [2023-08-26 20:08:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:56,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368864333] [2023-08-26 20:08:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368864333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:56,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:56,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068034513] [2023-08-26 20:08:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:56,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:56,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:56,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:08:56,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:56,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:56,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:08:56,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:57,101 INFO L124 PetriNetUnfolderBase]: 1879/2574 cut-off events. [2023-08-26 20:08:57,101 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2023-08-26 20:08:57,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6022 conditions, 2574 events. 1879/2574 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10797 event pairs, 374 based on Foata normal form. 242/2784 useless extension candidates. Maximal degree in co-relation 6017. Up to 1365 conditions per place. [2023-08-26 20:08:57,114 INFO L140 encePairwiseOnDemand]: 266/274 looper letters, 65 selfloop transitions, 5 changer transitions 2/74 dead transitions. [2023-08-26 20:08:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 354 flow [2023-08-26 20:08:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 20:08:57,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47007299270072994 [2023-08-26 20:08:57,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 20:08:57,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 20:08:57,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:57,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 20:08:57,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 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) [2023-08-26 20:08:57,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:57,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:57,121 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 97 flow. Second operand 5 states and 644 transitions. [2023-08-26 20:08:57,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 354 flow [2023-08-26 20:08:57,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:57,124 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 150 flow [2023-08-26 20:08:57,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-26 20:08:57,125 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-26 20:08:57,125 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 150 flow [2023-08-26 20:08:57,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:57,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:57,125 INFO L208 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] [2023-08-26 20:08:57,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 20:08:57,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:57,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -418009349, now seen corresponding path program 2 times [2023-08-26 20:08:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004303476] [2023-08-26 20:08:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:57,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004303476] [2023-08-26 20:08:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004303476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:57,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:08:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557857889] [2023-08-26 20:08:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:57,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:08:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:08:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:08:57,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:08:57,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:57,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:57,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:08:57,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:57,488 INFO L124 PetriNetUnfolderBase]: 1723/2393 cut-off events. [2023-08-26 20:08:57,488 INFO L125 PetriNetUnfolderBase]: For 2895/3256 co-relation queries the response was YES. [2023-08-26 20:08:57,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7651 conditions, 2393 events. 1723/2393 cut-off events. For 2895/3256 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10353 event pairs, 407 based on Foata normal form. 424/2783 useless extension candidates. Maximal degree in co-relation 7643. Up to 1550 conditions per place. [2023-08-26 20:08:57,501 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 55 selfloop transitions, 4 changer transitions 8/71 dead transitions. [2023-08-26 20:08:57,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 411 flow [2023-08-26 20:08:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:08:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:08:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-26 20:08:57,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48722627737226276 [2023-08-26 20:08:57,504 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-26 20:08:57,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-26 20:08:57,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:57,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-26 20:08:57,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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) [2023-08-26 20:08:57,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:57,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:57,507 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 150 flow. Second operand 4 states and 534 transitions. [2023-08-26 20:08:57,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 411 flow [2023-08-26 20:08:57,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 404 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:57,510 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 176 flow [2023-08-26 20:08:57,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-26 20:08:57,511 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-26 20:08:57,511 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 176 flow [2023-08-26 20:08:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:57,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:57,511 INFO L208 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] [2023-08-26 20:08:57,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 20:08:57,511 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:57,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 530712016, now seen corresponding path program 1 times [2023-08-26 20:08:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449344312] [2023-08-26 20:08:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449344312] [2023-08-26 20:08:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449344312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10414885] [2023-08-26 20:08:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:57,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:57,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:08:57,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:57,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:57,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:08:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:58,013 INFO L124 PetriNetUnfolderBase]: 2208/3158 cut-off events. [2023-08-26 20:08:58,014 INFO L125 PetriNetUnfolderBase]: For 6241/6623 co-relation queries the response was YES. [2023-08-26 20:08:58,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10320 conditions, 3158 events. 2208/3158 cut-off events. For 6241/6623 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15547 event pairs, 809 based on Foata normal form. 554/3686 useless extension candidates. Maximal degree in co-relation 10310. Up to 1939 conditions per place. [2023-08-26 20:08:58,029 INFO L140 encePairwiseOnDemand]: 266/274 looper letters, 63 selfloop transitions, 6 changer transitions 15/86 dead transitions. [2023-08-26 20:08:58,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 520 flow [2023-08-26 20:08:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-26 20:08:58,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47153284671532847 [2023-08-26 20:08:58,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-26 20:08:58,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-26 20:08:58,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:58,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-26 20:08:58,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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) [2023-08-26 20:08:58,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:58,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:58,036 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 176 flow. Second operand 5 states and 646 transitions. [2023-08-26 20:08:58,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 520 flow [2023-08-26 20:08:58,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 515 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:58,041 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 224 flow [2023-08-26 20:08:58,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2023-08-26 20:08:58,042 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-26 20:08:58,042 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 224 flow [2023-08-26 20:08:58,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:58,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:58,042 INFO L208 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] [2023-08-26 20:08:58,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 20:08:58,043 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:58,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1475633474, now seen corresponding path program 2 times [2023-08-26 20:08:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494554413] [2023-08-26 20:08:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494554413] [2023-08-26 20:08:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494554413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:58,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:08:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323820253] [2023-08-26 20:08:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:58,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:08:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:58,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:08:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:08:58,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:08:58,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:58,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:58,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:08:58,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:58,461 INFO L124 PetriNetUnfolderBase]: 2261/3232 cut-off events. [2023-08-26 20:08:58,461 INFO L125 PetriNetUnfolderBase]: For 12130/13036 co-relation queries the response was YES. [2023-08-26 20:08:58,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12780 conditions, 3232 events. 2261/3232 cut-off events. For 12130/13036 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15036 event pairs, 559 based on Foata normal form. 931/4038 useless extension candidates. Maximal degree in co-relation 12767. Up to 2138 conditions per place. [2023-08-26 20:08:58,480 INFO L140 encePairwiseOnDemand]: 269/274 looper letters, 57 selfloop transitions, 4 changer transitions 13/79 dead transitions. [2023-08-26 20:08:58,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 565 flow [2023-08-26 20:08:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:08:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:08:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-26 20:08:58,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48722627737226276 [2023-08-26 20:08:58,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-26 20:08:58,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-26 20:08:58,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:58,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-26 20:08:58,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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) [2023-08-26 20:08:58,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:58,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:58,486 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 224 flow. Second operand 4 states and 534 transitions. [2023-08-26 20:08:58,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 565 flow [2023-08-26 20:08:58,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 546 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 20:08:58,493 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 244 flow [2023-08-26 20:08:58,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-08-26 20:08:58,493 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-08-26 20:08:58,493 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 244 flow [2023-08-26 20:08:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:58,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:58,494 INFO L208 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] [2023-08-26 20:08:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 20:08:58,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:58,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 106566939, now seen corresponding path program 3 times [2023-08-26 20:08:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293797665] [2023-08-26 20:08:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293797665] [2023-08-26 20:08:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293797665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:58,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:58,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369318167] [2023-08-26 20:08:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:58,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:58,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:58,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:08:58,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:58,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:58,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:08:58,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:59,005 INFO L124 PetriNetUnfolderBase]: 2519/3615 cut-off events. [2023-08-26 20:08:59,006 INFO L125 PetriNetUnfolderBase]: For 14515/15172 co-relation queries the response was YES. [2023-08-26 20:08:59,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14569 conditions, 3615 events. 2519/3615 cut-off events. For 14515/15172 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 17214 event pairs, 1059 based on Foata normal form. 644/4224 useless extension candidates. Maximal degree in co-relation 14555. Up to 2658 conditions per place. [2023-08-26 20:08:59,025 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 55 selfloop transitions, 9 changer transitions 14/81 dead transitions. [2023-08-26 20:08:59,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 650 flow [2023-08-26 20:08:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-08-26 20:08:59,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591240875912409 [2023-08-26 20:08:59,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-08-26 20:08:59,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-08-26 20:08:59,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:59,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-08-26 20:08:59,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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) [2023-08-26 20:08:59,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:59,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:08:59,032 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 244 flow. Second operand 5 states and 629 transitions. [2023-08-26 20:08:59,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 650 flow [2023-08-26 20:08:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 641 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 20:08:59,047 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 339 flow [2023-08-26 20:08:59,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2023-08-26 20:08:59,047 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-26 20:08:59,048 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 339 flow [2023-08-26 20:08:59,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-26 20:08:59,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:59,048 INFO L208 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] [2023-08-26 20:08:59,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 20:08:59,048 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:59,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 498533996, now seen corresponding path program 3 times [2023-08-26 20:08:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362757635] [2023-08-26 20:08:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362757635] [2023-08-26 20:08:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362757635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:08:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954839038] [2023-08-26 20:08:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:08:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:59,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:08:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:08:59,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:08:59,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:59,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:59,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:08:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:59,643 INFO L124 PetriNetUnfolderBase]: 3626/5158 cut-off events. [2023-08-26 20:08:59,643 INFO L125 PetriNetUnfolderBase]: For 29984/31813 co-relation queries the response was YES. [2023-08-26 20:08:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23077 conditions, 5158 events. 3626/5158 cut-off events. For 29984/31813 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 26552 event pairs, 1372 based on Foata normal form. 1526/6508 useless extension candidates. Maximal degree in co-relation 23060. Up to 2902 conditions per place. [2023-08-26 20:08:59,680 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 78 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-26 20:08:59,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 816 flow [2023-08-26 20:08:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:08:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:08:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 20:08:59,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48175182481751827 [2023-08-26 20:08:59,683 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 20:08:59,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 20:08:59,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:59,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 20:08:59,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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) [2023-08-26 20:08:59,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:59,686 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:08:59,686 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 339 flow. Second operand 4 states and 528 transitions. [2023-08-26 20:08:59,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 816 flow [2023-08-26 20:08:59,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 753 flow, removed 25 selfloop flow, removed 2 redundant places. [2023-08-26 20:08:59,767 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 368 flow [2023-08-26 20:08:59,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-08-26 20:08:59,769 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-08-26 20:08:59,769 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 368 flow [2023-08-26 20:08:59,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:59,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:59,769 INFO L208 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] [2023-08-26 20:08:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 20:08:59,770 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:59,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1740619827, now seen corresponding path program 4 times [2023-08-26 20:08:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770737693] [2023-08-26 20:08:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770737693] [2023-08-26 20:08:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770737693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:08:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644809091] [2023-08-26 20:08:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:59,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:08:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:08:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:08:59,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:08:59,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:08:59,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:59,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:08:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:00,417 INFO L124 PetriNetUnfolderBase]: 3548/5222 cut-off events. [2023-08-26 20:09:00,418 INFO L125 PetriNetUnfolderBase]: For 31298/32706 co-relation queries the response was YES. [2023-08-26 20:09:00,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23843 conditions, 5222 events. 3548/5222 cut-off events. For 31298/32706 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 28340 event pairs, 1706 based on Foata normal form. 1485/6591 useless extension candidates. Maximal degree in co-relation 23825. Up to 3324 conditions per place. [2023-08-26 20:09:00,455 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 68 selfloop transitions, 7 changer transitions 6/87 dead transitions. [2023-08-26 20:09:00,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 770 flow [2023-08-26 20:09:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:09:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:09:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 20:09:00,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835766423357664 [2023-08-26 20:09:00,457 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 20:09:00,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 20:09:00,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:00,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 20:09:00,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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) [2023-08-26 20:09:00,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:00,461 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:00,461 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 368 flow. Second operand 4 states and 530 transitions. [2023-08-26 20:09:00,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 770 flow [2023-08-26 20:09:00,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 750 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-26 20:09:00,479 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 387 flow [2023-08-26 20:09:00,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2023-08-26 20:09:00,479 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-08-26 20:09:00,479 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 387 flow [2023-08-26 20:09:00,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:00,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:00,480 INFO L208 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] [2023-08-26 20:09:00,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 20:09:00,480 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:00,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1411075132, now seen corresponding path program 4 times [2023-08-26 20:09:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361676456] [2023-08-26 20:09:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361676456] [2023-08-26 20:09:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361676456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:09:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520567801] [2023-08-26 20:09:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:00,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:09:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:09:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:09:00,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:09:00,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:00,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:00,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:09:00,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:01,128 INFO L124 PetriNetUnfolderBase]: 3315/4934 cut-off events. [2023-08-26 20:09:01,128 INFO L125 PetriNetUnfolderBase]: For 32298/34068 co-relation queries the response was YES. [2023-08-26 20:09:01,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23050 conditions, 4934 events. 3315/4934 cut-off events. For 32298/34068 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26384 event pairs, 1655 based on Foata normal form. 1798/6664 useless extension candidates. Maximal degree in co-relation 23031. Up to 4068 conditions per place. [2023-08-26 20:09:01,167 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 56 selfloop transitions, 6 changer transitions 16/83 dead transitions. [2023-08-26 20:09:01,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 754 flow [2023-08-26 20:09:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:09:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:09:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 20:09:01,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835766423357664 [2023-08-26 20:09:01,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 20:09:01,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 20:09:01,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:01,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 20:09:01,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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) [2023-08-26 20:09:01,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:01,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:01,174 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 387 flow. Second operand 4 states and 530 transitions. [2023-08-26 20:09:01,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 754 flow [2023-08-26 20:09:01,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:09:01,191 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 396 flow [2023-08-26 20:09:01,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-26 20:09:01,192 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-26 20:09:01,192 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 396 flow [2023-08-26 20:09:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:01,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:01,192 INFO L208 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] [2023-08-26 20:09:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 20:09:01,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:01,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1920287579, now seen corresponding path program 5 times [2023-08-26 20:09:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911416054] [2023-08-26 20:09:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911416054] [2023-08-26 20:09:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911416054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:09:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583114664] [2023-08-26 20:09:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:01,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:09:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:01,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:09:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:09:01,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:09:01,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:01,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:01,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:09:01,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:01,977 INFO L124 PetriNetUnfolderBase]: 4895/7106 cut-off events. [2023-08-26 20:09:01,977 INFO L125 PetriNetUnfolderBase]: For 48995/51373 co-relation queries the response was YES. [2023-08-26 20:09:02,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34270 conditions, 7106 events. 4895/7106 cut-off events. For 48995/51373 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38032 event pairs, 2019 based on Foata normal form. 1848/8737 useless extension candidates. Maximal degree in co-relation 34249. Up to 5394 conditions per place. [2023-08-26 20:09:02,031 INFO L140 encePairwiseOnDemand]: 269/274 looper letters, 64 selfloop transitions, 6 changer transitions 13/90 dead transitions. [2023-08-26 20:09:02,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 832 flow [2023-08-26 20:09:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:09:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:09:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-26 20:09:02,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48722627737226276 [2023-08-26 20:09:02,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-26 20:09:02,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-26 20:09:02,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:02,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-26 20:09:02,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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) [2023-08-26 20:09:02,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:02,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:02,037 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 396 flow. Second operand 4 states and 534 transitions. [2023-08-26 20:09:02,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 832 flow [2023-08-26 20:09:02,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:09:02,057 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 432 flow [2023-08-26 20:09:02,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=77, PETRI_TRANSITIONS=50} [2023-08-26 20:09:02,058 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-26 20:09:02,058 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 432 flow [2023-08-26 20:09:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:02,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:02,058 INFO L208 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] [2023-08-26 20:09:02,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 20:09:02,059 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:02,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 972098503, now seen corresponding path program 6 times [2023-08-26 20:09:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867637556] [2023-08-26 20:09:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867637556] [2023-08-26 20:09:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867637556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:09:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497594250] [2023-08-26 20:09:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:02,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:09:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:09:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:09:02,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-26 20:09:02,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 50 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:02,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:02,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-26 20:09:02,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:02,738 INFO L124 PetriNetUnfolderBase]: 5029/7119 cut-off events. [2023-08-26 20:09:02,738 INFO L125 PetriNetUnfolderBase]: For 61541/63989 co-relation queries the response was YES. [2023-08-26 20:09:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37852 conditions, 7119 events. 5029/7119 cut-off events. For 61541/63989 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 36589 event pairs, 1847 based on Foata normal form. 2049/8950 useless extension candidates. Maximal degree in co-relation 37829. Up to 4070 conditions per place. [2023-08-26 20:09:02,784 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 69 selfloop transitions, 18 changer transitions 5/99 dead transitions. [2023-08-26 20:09:02,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 1086 flow [2023-08-26 20:09:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:09:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:09:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 20:09:02,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48175182481751827 [2023-08-26 20:09:02,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 20:09:02,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 20:09:02,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:02,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 20:09:02,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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) [2023-08-26 20:09:02,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:02,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:02,790 INFO L175 Difference]: Start difference. First operand has 77 places, 50 transitions, 432 flow. Second operand 4 states and 528 transitions. [2023-08-26 20:09:02,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 1086 flow [2023-08-26 20:09:02,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:09:02,816 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 716 flow [2023-08-26 20:09:02,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=716, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2023-08-26 20:09:02,817 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2023-08-26 20:09:02,817 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 716 flow [2023-08-26 20:09:02,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-08-26 20:09:02,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:02,817 INFO L208 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] [2023-08-26 20:09:02,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 20:09:02,818 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:02,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1323345930, now seen corresponding path program 1 times [2023-08-26 20:09:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199523303] [2023-08-26 20:09:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199523303] [2023-08-26 20:09:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199523303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:09:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801984521] [2023-08-26 20:09:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:02,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:09:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:09:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:09:02,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:09:02,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 716 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-26 20:09:02,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:02,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:09:02,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:03,505 INFO L124 PetriNetUnfolderBase]: 4993/6787 cut-off events. [2023-08-26 20:09:03,505 INFO L125 PetriNetUnfolderBase]: For 83851/85351 co-relation queries the response was YES. [2023-08-26 20:09:03,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42381 conditions, 6787 events. 4993/6787 cut-off events. For 83851/85351 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 31362 event pairs, 1949 based on Foata normal form. 1435/8144 useless extension candidates. Maximal degree in co-relation 42357. Up to 5267 conditions per place. [2023-08-26 20:09:03,549 INFO L140 encePairwiseOnDemand]: 266/274 looper letters, 76 selfloop transitions, 32 changer transitions 6/118 dead transitions. [2023-08-26 20:09:03,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 1572 flow [2023-08-26 20:09:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-26 20:09:03,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46131386861313867 [2023-08-26 20:09:03,552 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-26 20:09:03,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-26 20:09:03,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:03,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-26 20:09:03,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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) [2023-08-26 20:09:03,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:09:03,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:09:03,556 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 716 flow. Second operand 5 states and 632 transitions. [2023-08-26 20:09:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 1572 flow [2023-08-26 20:09:03,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 118 transitions, 1464 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-08-26 20:09:03,589 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 1081 flow [2023-08-26 20:09:03,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1081, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2023-08-26 20:09:03,590 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-26 20:09:03,590 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 1081 flow [2023-08-26 20:09:03,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-26 20:09:03,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:03,591 INFO L208 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] [2023-08-26 20:09:03,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 20:09:03,591 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:03,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2033336695, now seen corresponding path program 1 times [2023-08-26 20:09:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220202442] [2023-08-26 20:09:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220202442] [2023-08-26 20:09:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220202442] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313567032] [2023-08-26 20:09:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:03,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:03,701 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) [2023-08-26 20:09:03,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 20:09:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:03,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:09:03,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:03,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:03,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313567032] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:03,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:03,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2023-08-26 20:09:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900606975] [2023-08-26 20:09:03,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:03,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 20:09:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 20:09:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 20:09:03,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 274 [2023-08-26 20:09:03,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 1081 flow. Second operand has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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) [2023-08-26 20:09:03,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:03,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 274 [2023-08-26 20:09:03,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:05,563 INFO L124 PetriNetUnfolderBase]: 9382/12513 cut-off events. [2023-08-26 20:09:05,563 INFO L125 PetriNetUnfolderBase]: For 143198/144164 co-relation queries the response was YES. [2023-08-26 20:09:05,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80778 conditions, 12513 events. 9382/12513 cut-off events. For 143198/144164 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 59505 event pairs, 2349 based on Foata normal form. 1308/13804 useless extension candidates. Maximal degree in co-relation 80752. Up to 6631 conditions per place. [2023-08-26 20:09:05,668 INFO L140 encePairwiseOnDemand]: 264/274 looper letters, 225 selfloop transitions, 108 changer transitions 10/345 dead transitions. [2023-08-26 20:09:05,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 345 transitions, 4891 flow [2023-08-26 20:09:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 20:09:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 20:09:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1822 transitions. [2023-08-26 20:09:05,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44330900243309 [2023-08-26 20:09:05,674 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1822 transitions. [2023-08-26 20:09:05,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1822 transitions. [2023-08-26 20:09:05,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:05,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1822 transitions. [2023-08-26 20:09:05,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 121.46666666666667) internal successors, (1822), 15 states have internal predecessors, (1822), 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) [2023-08-26 20:09:05,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2023-08-26 20:09:05,698 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2023-08-26 20:09:05,698 INFO L175 Difference]: Start difference. First operand has 83 places, 81 transitions, 1081 flow. Second operand 15 states and 1822 transitions. [2023-08-26 20:09:05,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 345 transitions, 4891 flow [2023-08-26 20:09:05,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 345 transitions, 4663 flow, removed 80 selfloop flow, removed 3 redundant places. [2023-08-26 20:09:05,781 INFO L231 Difference]: Finished difference. Result has 103 places, 176 transitions, 2893 flow [2023-08-26 20:09:05,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2893, PETRI_PLACES=103, PETRI_TRANSITIONS=176} [2023-08-26 20:09:05,782 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2023-08-26 20:09:05,782 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 176 transitions, 2893 flow [2023-08-26 20:09:05,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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) [2023-08-26 20:09:05,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:05,783 INFO L208 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] [2023-08-26 20:09:05,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:05,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-26 20:09:05,989 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:05,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1221151303, now seen corresponding path program 2 times [2023-08-26 20:09:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563129458] [2023-08-26 20:09:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:06,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563129458] [2023-08-26 20:09:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563129458] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799533993] [2023-08-26 20:09:06,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:09:06,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:06,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:06,103 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) [2023-08-26 20:09:06,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 20:09:06,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 20:09:06,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:09:06,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:09:06,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:06,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799533993] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:06,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-26 20:09:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329131318] [2023-08-26 20:09:06,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:09:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:09:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:09:06,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:09:06,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 176 transitions, 2893 flow. Second operand has 8 states, 8 states have (on average 118.25) internal successors, (946), 8 states have internal predecessors, (946), 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) [2023-08-26 20:09:06,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:06,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:09:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:07,721 INFO L124 PetriNetUnfolderBase]: 9134/11990 cut-off events. [2023-08-26 20:09:07,721 INFO L125 PetriNetUnfolderBase]: For 242491/244636 co-relation queries the response was YES. [2023-08-26 20:09:07,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93438 conditions, 11990 events. 9134/11990 cut-off events. For 242491/244636 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 55647 event pairs, 2186 based on Foata normal form. 2047/13841 useless extension candidates. Maximal degree in co-relation 93403. Up to 7750 conditions per place. [2023-08-26 20:09:07,801 INFO L140 encePairwiseOnDemand]: 267/274 looper letters, 172 selfloop transitions, 74 changer transitions 4/258 dead transitions. [2023-08-26 20:09:07,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 258 transitions, 4581 flow [2023-08-26 20:09:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 20:09:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46277372262773725 [2023-08-26 20:09:07,805 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 20:09:07,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 20:09:07,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:07,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 20:09:07,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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) [2023-08-26 20:09:07,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:09:07,809 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2023-08-26 20:09:07,809 INFO L175 Difference]: Start difference. First operand has 103 places, 176 transitions, 2893 flow. Second operand 5 states and 634 transitions. [2023-08-26 20:09:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 258 transitions, 4581 flow [2023-08-26 20:09:08,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 258 transitions, 4211 flow, removed 180 selfloop flow, removed 1 redundant places. [2023-08-26 20:09:08,089 INFO L231 Difference]: Finished difference. Result has 107 places, 205 transitions, 3397 flow [2023-08-26 20:09:08,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3397, PETRI_PLACES=107, PETRI_TRANSITIONS=205} [2023-08-26 20:09:08,089 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2023-08-26 20:09:08,089 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 205 transitions, 3397 flow [2023-08-26 20:09:08,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.25) internal successors, (946), 8 states have internal predecessors, (946), 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) [2023-08-26 20:09:08,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:08,090 INFO L208 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] [2023-08-26 20:09:08,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:08,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-26 20:09:08,293 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:08,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 247631195, now seen corresponding path program 1 times [2023-08-26 20:09:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084482648] [2023-08-26 20:09:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:08,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084482648] [2023-08-26 20:09:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084482648] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547745331] [2023-08-26 20:09:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:08,428 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) [2023-08-26 20:09:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 20:09:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:08,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:09:08,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:08,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547745331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:08,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:08,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-26 20:09:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002994970] [2023-08-26 20:09:08,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:08,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:09:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:09:08,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:09:08,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:09:08,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 205 transitions, 3397 flow. Second operand has 8 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 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) [2023-08-26 20:09:08,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:08,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:09:08,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:10,089 INFO L124 PetriNetUnfolderBase]: 10008/12897 cut-off events. [2023-08-26 20:09:10,089 INFO L125 PetriNetUnfolderBase]: For 261837/263470 co-relation queries the response was YES. [2023-08-26 20:09:10,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102887 conditions, 12897 events. 10008/12897 cut-off events. For 261837/263470 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 57278 event pairs, 1716 based on Foata normal form. 1465/14259 useless extension candidates. Maximal degree in co-relation 102850. Up to 8235 conditions per place. [2023-08-26 20:09:10,278 INFO L140 encePairwiseOnDemand]: 267/274 looper letters, 163 selfloop transitions, 152 changer transitions 1/326 dead transitions. [2023-08-26 20:09:10,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 326 transitions, 5916 flow [2023-08-26 20:09:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:09:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:09:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2023-08-26 20:09:10,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4610705596107056 [2023-08-26 20:09:10,281 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2023-08-26 20:09:10,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2023-08-26 20:09:10,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:10,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2023-08-26 20:09:10,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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) [2023-08-26 20:09:10,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 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) [2023-08-26 20:09:10,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 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) [2023-08-26 20:09:10,285 INFO L175 Difference]: Start difference. First operand has 107 places, 205 transitions, 3397 flow. Second operand 6 states and 758 transitions. [2023-08-26 20:09:10,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 326 transitions, 5916 flow [2023-08-26 20:09:10,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 326 transitions, 5356 flow, removed 208 selfloop flow, removed 4 redundant places. [2023-08-26 20:09:10,562 INFO L231 Difference]: Finished difference. Result has 110 places, 264 transitions, 4609 flow [2023-08-26 20:09:10,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=3081, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4609, PETRI_PLACES=110, PETRI_TRANSITIONS=264} [2023-08-26 20:09:10,563 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2023-08-26 20:09:10,563 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 264 transitions, 4609 flow [2023-08-26 20:09:10,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 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) [2023-08-26 20:09:10,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:10,564 INFO L208 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] [2023-08-26 20:09:10,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:10,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:10,773 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:10,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1630586358, now seen corresponding path program 1 times [2023-08-26 20:09:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876893088] [2023-08-26 20:09:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876893088] [2023-08-26 20:09:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876893088] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594676507] [2023-08-26 20:09:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:10,996 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) [2023-08-26 20:09:11,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 20:09:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:11,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 20:09:11,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:11,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594676507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:11,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2023-08-26 20:09:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254711254] [2023-08-26 20:09:11,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:09:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:09:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:09:11,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-08-26 20:09:11,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 264 transitions, 4609 flow. Second operand has 8 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 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) [2023-08-26 20:09:11,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:11,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-08-26 20:09:11,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:14,369 INFO L124 PetriNetUnfolderBase]: 18673/24723 cut-off events. [2023-08-26 20:09:14,369 INFO L125 PetriNetUnfolderBase]: For 502353/508883 co-relation queries the response was YES. [2023-08-26 20:09:14,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192154 conditions, 24723 events. 18673/24723 cut-off events. For 502353/508883 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 130648 event pairs, 2070 based on Foata normal form. 4467/28024 useless extension candidates. Maximal degree in co-relation 192115. Up to 15311 conditions per place. [2023-08-26 20:09:14,594 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 246 selfloop transitions, 240 changer transitions 3/512 dead transitions. [2023-08-26 20:09:14,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 512 transitions, 9465 flow [2023-08-26 20:09:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:09:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:09:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-08-26 20:09:14,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209854014598541 [2023-08-26 20:09:14,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-08-26 20:09:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-08-26 20:09:14,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:14,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-08-26 20:09:14,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-08-26 20:09:14,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:14,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2023-08-26 20:09:14,600 INFO L175 Difference]: Start difference. First operand has 110 places, 264 transitions, 4609 flow. Second operand 4 states and 571 transitions. [2023-08-26 20:09:14,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 512 transitions, 9465 flow [2023-08-26 20:09:15,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 512 transitions, 8992 flow, removed 125 selfloop flow, removed 5 redundant places. [2023-08-26 20:09:15,521 INFO L231 Difference]: Finished difference. Result has 109 places, 469 transitions, 9147 flow [2023-08-26 20:09:15,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=4334, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9147, PETRI_PLACES=109, PETRI_TRANSITIONS=469} [2023-08-26 20:09:15,522 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 55 predicate places. [2023-08-26 20:09:15,522 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 469 transitions, 9147 flow [2023-08-26 20:09:15,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 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) [2023-08-26 20:09:15,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:15,522 INFO L208 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] [2023-08-26 20:09:15,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:15,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:15,723 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:15,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1098035964, now seen corresponding path program 2 times [2023-08-26 20:09:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333751149] [2023-08-26 20:09:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333751149] [2023-08-26 20:09:15,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333751149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562494810] [2023-08-26 20:09:15,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:09:15,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:15,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:09:15,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 20:09:16,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 20:09:16,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:09:16,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-26 20:09:16,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:16,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562494810] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:16,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-26 20:09:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113025558] [2023-08-26 20:09:16,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 20:09:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 20:09:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-08-26 20:09:16,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 274 [2023-08-26 20:09:16,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 469 transitions, 9147 flow. Second operand has 16 states, 16 states have (on average 111.125) internal successors, (1778), 16 states have internal predecessors, (1778), 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) [2023-08-26 20:09:16,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:16,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 274 [2023-08-26 20:09:16,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:31,392 INFO L124 PetriNetUnfolderBase]: 66394/88276 cut-off events. [2023-08-26 20:09:31,392 INFO L125 PetriNetUnfolderBase]: For 1764842/1773498 co-relation queries the response was YES. [2023-08-26 20:09:31,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718409 conditions, 88276 events. 66394/88276 cut-off events. For 1764842/1773498 co-relation queries the response was YES. Maximal size of possible extension queue 3945. Compared 538879 event pairs, 3018 based on Foata normal form. 9152/97261 useless extension candidates. Maximal degree in co-relation 718371. Up to 49357 conditions per place. [2023-08-26 20:09:32,534 INFO L140 encePairwiseOnDemand]: 264/274 looper letters, 731 selfloop transitions, 1761 changer transitions 38/2540 dead transitions. [2023-08-26 20:09:32,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 2540 transitions, 47205 flow [2023-08-26 20:09:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-08-26 20:09:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-08-26 20:09:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 6431 transitions. [2023-08-26 20:09:32,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44284533810769866 [2023-08-26 20:09:32,544 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 6431 transitions. [2023-08-26 20:09:32,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 6431 transitions. [2023-08-26 20:09:32,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:32,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 6431 transitions. [2023-08-26 20:09:32,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 121.33962264150944) internal successors, (6431), 53 states have internal predecessors, (6431), 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) [2023-08-26 20:09:32,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 274.0) internal successors, (14796), 54 states have internal predecessors, (14796), 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) [2023-08-26 20:09:32,576 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 274.0) internal successors, (14796), 54 states have internal predecessors, (14796), 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) [2023-08-26 20:09:32,576 INFO L175 Difference]: Start difference. First operand has 109 places, 469 transitions, 9147 flow. Second operand 53 states and 6431 transitions. [2023-08-26 20:09:32,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 2540 transitions, 47205 flow [2023-08-26 20:09:36,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 2540 transitions, 46765 flow, removed 220 selfloop flow, removed 0 redundant places. [2023-08-26 20:09:36,980 INFO L231 Difference]: Finished difference. Result has 201 places, 2041 transitions, 46455 flow [2023-08-26 20:09:36,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=8843, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=46455, PETRI_PLACES=201, PETRI_TRANSITIONS=2041} [2023-08-26 20:09:36,981 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 147 predicate places. [2023-08-26 20:09:36,981 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 2041 transitions, 46455 flow [2023-08-26 20:09:36,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 111.125) internal successors, (1778), 16 states have internal predecessors, (1778), 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) [2023-08-26 20:09:36,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:36,982 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-26 20:09:36,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:37,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 20:09:37,182 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:37,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1754716683, now seen corresponding path program 3 times [2023-08-26 20:09:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765271160] [2023-08-26 20:09:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:37,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765271160] [2023-08-26 20:09:37,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765271160] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483925263] [2023-08-26 20:09:37,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 20:09:37,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:37,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:37,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:09:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 20:09:37,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 20:09:37,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:09:37,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 20:09:37,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:37,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:37,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483925263] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:37,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-08-26 20:09:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727232373] [2023-08-26 20:09:37,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:37,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 20:09:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:37,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 20:09:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-26 20:09:37,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:09:37,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 2041 transitions, 46455 flow. Second operand has 12 states, 12 states have (on average 117.33333333333333) internal successors, (1408), 12 states have internal predecessors, (1408), 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) [2023-08-26 20:09:37,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:37,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:09:37,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:10:27,518 INFO L124 PetriNetUnfolderBase]: 114918/151093 cut-off events. [2023-08-26 20:10:27,518 INFO L125 PetriNetUnfolderBase]: For 5846739/5858863 co-relation queries the response was YES. [2023-08-26 20:10:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565587 conditions, 151093 events. 114918/151093 cut-off events. For 5846739/5858863 co-relation queries the response was YES. Maximal size of possible extension queue 6529. Compared 946920 event pairs, 8525 based on Foata normal form. 9455/158718 useless extension candidates. Maximal degree in co-relation 1565508. Up to 75330 conditions per place. [2023-08-26 20:10:30,294 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 4373 selfloop transitions, 1058 changer transitions 0/5473 dead transitions. [2023-08-26 20:10:30,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 5473 transitions, 135105 flow [2023-08-26 20:10:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 20:10:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 20:10:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1667 transitions. [2023-08-26 20:10:30,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46799550814149354 [2023-08-26 20:10:30,297 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1667 transitions. [2023-08-26 20:10:30,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1667 transitions. [2023-08-26 20:10:30,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:10:30,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1667 transitions. [2023-08-26 20:10:30,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 128.23076923076923) internal successors, (1667), 13 states have internal predecessors, (1667), 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) [2023-08-26 20:10:30,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 274.0) internal successors, (3836), 14 states have internal predecessors, (3836), 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) [2023-08-26 20:10:30,303 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 274.0) internal successors, (3836), 14 states have internal predecessors, (3836), 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) [2023-08-26 20:10:30,303 INFO L175 Difference]: Start difference. First operand has 201 places, 2041 transitions, 46455 flow. Second operand 13 states and 1667 transitions. [2023-08-26 20:10:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 5473 transitions, 135105 flow [2023-08-26 20:13:00,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 5473 transitions, 99123 flow, removed 17984 selfloop flow, removed 1 redundant places. [2023-08-26 20:13:00,801 INFO L231 Difference]: Finished difference. Result has 222 places, 2827 transitions, 50074 flow [2023-08-26 20:13:00,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=34203, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=50074, PETRI_PLACES=222, PETRI_TRANSITIONS=2827} [2023-08-26 20:13:00,803 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 168 predicate places. [2023-08-26 20:13:00,803 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 2827 transitions, 50074 flow [2023-08-26 20:13:00,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 117.33333333333333) internal successors, (1408), 12 states have internal predecessors, (1408), 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) [2023-08-26 20:13:00,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:13:00,804 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-26 20:13:00,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 20:13:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 20:13:01,009 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:13:01,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:13:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1247573428, now seen corresponding path program 4 times [2023-08-26 20:13:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:13:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746790006] [2023-08-26 20:13:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:13:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:13:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:13:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:13:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:13:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746790006] [2023-08-26 20:13:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746790006] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:13:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679639454] [2023-08-26 20:13:01,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:13:01,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:13:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:13:01,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:13:01,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 20:13:01,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:13:01,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:13:01,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-26 20:13:01,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:13:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:13:01,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:13:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:13:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679639454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:13:01,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:13:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-26 20:13:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768737041] [2023-08-26 20:13:01,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:13:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 20:13:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:13:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 20:13:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-26 20:13:01,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2023-08-26 20:13:01,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 2827 transitions, 50074 flow. Second operand has 12 states, 12 states have (on average 117.16666666666667) internal successors, (1406), 12 states have internal predecessors, (1406), 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) [2023-08-26 20:13:01,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:13:01,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2023-08-26 20:13:01,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:13:15,052 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L62-4-->L62-4: Formula: (and (= (+ v_~c~0_48 v_~counter~0_84) v_~counter~0_83) (< (mod v_thread3Thread1of1ForFork3_~i~2_32 4294967296) (mod v_~N~0_57 4294967296)) (= v_thread3Thread1of1ForFork3_~i~2_31 (+ v_thread3Thread1of1ForFork3_~i~2_32 1))) InVars {~counter~0=v_~counter~0_84, ~c~0=v_~c~0_48, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_32} OutVars{~counter~0=v_~counter~0_83, ~c~0=v_~c~0_48, thread3Thread1of1ForFork3_#t~post3=|v_thread3Thread1of1ForFork3_#t~post3_17|, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_31} AuxVars[] AssignedVars[~counter~0, thread3Thread1of1ForFork3_#t~post3, thread3Thread1of1ForFork3_~i~2][945], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 99#L95-2true, 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 42#L72-4true, 24#L51-4true, Black: 195#(= ~counter~0 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 232#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:15,052 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,052 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,052 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,053 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([529] L72-4-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0)) (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_36| 4294967296) (mod v_~N~0_55 4294967296)) (= |v_thread4Thread1of1ForFork1_~i~3#1_35| (+ |v_thread4Thread1of1ForFork1_~i~3#1_36| 1)) (= (+ v_~c~0_46 v_~counter~0_79) v_~counter~0_80) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_80, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_36|, ~N~0=v_~N~0_55} OutVars{~counter~0=v_~counter~0_79, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_35|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_13|, ~N~0=v_~N~0_55, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][946], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 42#L72-4true, 24#L51-4true, 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 634#true, 280#true, 99#L95-2true, 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 241#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:15,054 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,054 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,054 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,054 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_36| 4294967296) (mod v_~N~0_53 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_35| (+ |v_thread2Thread1of1ForFork0_~i~1#1_36| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 (mod v_~counter~0_76 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_76 (+ v_~c~0_44 v_~counter~0_75))) InVars {~counter~0=v_~counter~0_76, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_36|, ~N~0=v_~N~0_53} OutVars{~counter~0=v_~counter~0_75, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_13|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_~i~1#1][947], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 810#true, Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 99#L95-2true, 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 42#L72-4true, 24#L51-4true, 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 200#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:15,055 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,055 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,055 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:15,055 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:13:22,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_36| 4294967296) (mod v_~N~0_53 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_35| (+ |v_thread2Thread1of1ForFork0_~i~1#1_36| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 (mod v_~counter~0_76 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_76 (+ v_~c~0_44 v_~counter~0_75))) InVars {~counter~0=v_~counter~0_76, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_36|, ~N~0=v_~N~0_53} OutVars{~counter~0=v_~counter~0_75, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_13|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_~i~1#1][1442], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 810#true, Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 99#L95-2true, 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 24#L51-4true, 42#L72-4true, Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 200#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0)]) [2023-08-26 20:13:22,691 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,691 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,691 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,691 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([529] L72-4-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0)) (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_36| 4294967296) (mod v_~N~0_55 4294967296)) (= |v_thread4Thread1of1ForFork1_~i~3#1_35| (+ |v_thread4Thread1of1ForFork1_~i~3#1_36| 1)) (= (+ v_~c~0_46 v_~counter~0_79) v_~counter~0_80) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_80, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_36|, ~N~0=v_~N~0_55} OutVars{~counter~0=v_~counter~0_79, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_35|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_13|, ~N~0=v_~N~0_55, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1444], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 24#L51-4true, 42#L72-4true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 634#true, 280#true, 99#L95-2true, 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 241#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0)]) [2023-08-26 20:13:22,692 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L62-4-->L62-4: Formula: (and (= (+ v_~c~0_48 v_~counter~0_84) v_~counter~0_83) (< (mod v_thread3Thread1of1ForFork3_~i~2_32 4294967296) (mod v_~N~0_57 4294967296)) (= v_thread3Thread1of1ForFork3_~i~2_31 (+ v_thread3Thread1of1ForFork3_~i~2_32 1))) InVars {~counter~0=v_~counter~0_84, ~c~0=v_~c~0_48, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_32} OutVars{~counter~0=v_~counter~0_83, ~c~0=v_~c~0_48, thread3Thread1of1ForFork3_#t~post3=|v_thread3Thread1of1ForFork3_#t~post3_17|, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_31} AuxVars[] AssignedVars[~counter~0, thread3Thread1of1ForFork3_#t~post3, thread3Thread1of1ForFork3_~i~2][1445], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 24#L51-4true, 42#L72-4true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 99#L95-2true, 1182#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 232#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:22,692 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,692 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,693 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L62-4-->L62-4: Formula: (and (= (+ v_~c~0_48 v_~counter~0_84) v_~counter~0_83) (< (mod v_thread3Thread1of1ForFork3_~i~2_32 4294967296) (mod v_~N~0_57 4294967296)) (= v_thread3Thread1of1ForFork3_~i~2_31 (+ v_thread3Thread1of1ForFork3_~i~2_32 1))) InVars {~counter~0=v_~counter~0_84, ~c~0=v_~c~0_48, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_32} OutVars{~counter~0=v_~counter~0_83, ~c~0=v_~c~0_48, thread3Thread1of1ForFork3_#t~post3=|v_thread3Thread1of1ForFork3_#t~post3_17|, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_31} AuxVars[] AssignedVars[~counter~0, thread3Thread1of1ForFork3_#t~post3, thread3Thread1of1ForFork3_~i~2][945], [60#L96-1true, Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 42#L72-4true, 24#L51-4true, Black: 195#(= ~counter~0 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 232#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:22,923 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,923 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,923 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,923 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([529] L72-4-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0)) (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_36| 4294967296) (mod v_~N~0_55 4294967296)) (= |v_thread4Thread1of1ForFork1_~i~3#1_35| (+ |v_thread4Thread1of1ForFork1_~i~3#1_36| 1)) (= (+ v_~c~0_46 v_~counter~0_79) v_~counter~0_80) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_80, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_36|, ~N~0=v_~N~0_55} OutVars{~counter~0=v_~counter~0_79, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_35|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_13|, ~N~0=v_~N~0_55, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][946], [60#L96-1true, Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 42#L72-4true, 24#L51-4true, 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 634#true, 280#true, 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 241#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:22,924 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,924 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,924 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,924 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_36| 4294967296) (mod v_~N~0_53 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_35| (+ |v_thread2Thread1of1ForFork0_~i~1#1_36| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 (mod v_~counter~0_76 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_76 (+ v_~c~0_44 v_~counter~0_75))) InVars {~counter~0=v_~counter~0_76, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_36|, ~N~0=v_~N~0_53} OutVars{~counter~0=v_~counter~0_75, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_13|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_~i~1#1][947], [60#L96-1true, Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 810#true, Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 42#L72-4true, 24#L51-4true, 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 200#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:22,925 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,925 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,925 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:22,925 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_36| 4294967296) (mod v_~N~0_53 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_35| (+ |v_thread2Thread1of1ForFork0_~i~1#1_36| 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= (ite (< 0 (mod v_~counter~0_76 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= v_~counter~0_76 (+ v_~c~0_44 v_~counter~0_75))) InVars {~counter~0=v_~counter~0_76, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_36|, ~N~0=v_~N~0_53} OutVars{~counter~0=v_~counter~0_75, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, ~c~0=v_~c~0_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_13|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_~i~1#1][1442], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), 60#L96-1true, Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 810#true, Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), 155#true, Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 40#L62-4true, 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 24#L51-4true, 42#L72-4true, Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 200#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0)]) [2023-08-26 20:13:31,920 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([529] L72-4-->L72-4: Formula: (and (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0)) (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_36| 4294967296) (mod v_~N~0_55 4294967296)) (= |v_thread4Thread1of1ForFork1_~i~3#1_35| (+ |v_thread4Thread1of1ForFork1_~i~3#1_36| 1)) (= (+ v_~c~0_46 v_~counter~0_79) v_~counter~0_80) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_80, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_36|, ~N~0=v_~N~0_55} OutVars{~counter~0=v_~counter~0_79, ~c~0=v_~c~0_46, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_35|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_13|, ~N~0=v_~N~0_55, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1444], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), 60#L96-1true, Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 24#L51-4true, 42#L72-4true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 634#true, 280#true, 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 241#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0)]) [2023-08-26 20:13:31,920 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,920 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L62-4-->L62-4: Formula: (and (= (+ v_~c~0_48 v_~counter~0_84) v_~counter~0_83) (< (mod v_thread3Thread1of1ForFork3_~i~2_32 4294967296) (mod v_~N~0_57 4294967296)) (= v_thread3Thread1of1ForFork3_~i~2_31 (+ v_thread3Thread1of1ForFork3_~i~2_32 1))) InVars {~counter~0=v_~counter~0_84, ~c~0=v_~c~0_48, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_32} OutVars{~counter~0=v_~counter~0_83, ~c~0=v_~c~0_48, thread3Thread1of1ForFork3_#t~post3=|v_thread3Thread1of1ForFork3_#t~post3_17|, ~N~0=v_~N~0_57, thread3Thread1of1ForFork3_~i~2=v_thread3Thread1of1ForFork3_~i~2_31} AuxVars[] AssignedVars[~counter~0, thread3Thread1of1ForFork3_#t~post3, thread3Thread1of1ForFork3_~i~2][1445], [Black: 1180#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296))), 60#L96-1true, Black: 255#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1176#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1216#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1228#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1222#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), Black: 1200#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1244#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1509#true, Black: 1220#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 994#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), 810#true, Black: 261#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1174#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1059#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 1242#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1190#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1240#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1)), Black: 268#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 274#(= thread1Thread1of1ForFork2_~i~0 0), Black: 637#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 805#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 636#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 40#L62-4true, 24#L51-4true, 42#L72-4true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 172#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 191#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), Black: 470#(= thread3Thread1of1ForFork3_~i~2 0), 176#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 262#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 164#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#true, 638#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 1182#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296))))), 411#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)), 1298#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 160#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 195#(= ~counter~0 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296))), Black: 201#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 456#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 448#(and (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 209#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 202#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 318#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 284#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 454#(and (= thread3Thread1of1ForFork3_~i~2 0) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork2_~i~0 4294967296) 1)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), Black: 210#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 180#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 168#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1492#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 813#(and (<= ~counter~0 ~c~0) (<= ~c~0 ~counter~0)), Black: 1484#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 812#(= ~counter~0 0), 226#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 216#(= thread1Thread1of1ForFork2_~i~0 0), Black: 1334#(= thread1Thread1of1ForFork2_~i~0 1), Black: 1297#(<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0), Black: 1353#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1494#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1481#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1487#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (* (div (+ thread1Thread1of1ForFork2_~i~0 1) 4294967296) 4294967296) thread1Thread1of1ForFork2_~i~0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 1489#(and (<= (+ (* (div thread1Thread1of1ForFork2_~i~0 4294967296) 4294967296) 1) thread1Thread1of1ForFork2_~i~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 225#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1218#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1208#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1198#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296)))), Black: 1204#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 269#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1212#(and (= ~counter~0 0) (< 0 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 1) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1105#(or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))), 254#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1178#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 233#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1248#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1145#(or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 232#(= thread3Thread1of1ForFork3_~i~2 0), Black: 1252#(and (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1226#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1186#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1230#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1234#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1246#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1196#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1206#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1224#(and (= ~counter~0 (* 2 ~c~0)) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (< 0 (mod ~N~0 4294967296)) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1029#(and (= ~counter~0 ~c~0) (< 0 (mod ~N~0 4294967296))), Black: 1192#(and (= ~counter~0 ~c~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1238#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0)) (< (mod (+ |thread4Thread1of1ForFork1_~i~3#1| 1) 4294967296) (mod ~N~0 4294967296))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (= ~counter~0 0)), Black: 1194#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1045#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296))), Black: 1188#(and (= ~counter~0 (* 2 ~c~0)) (< 0 (mod ~N~0 4294967296)) (or (< 0 (mod thread1Thread1of1ForFork2_~i~0 4294967296)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 991#(= ~counter~0 0), Black: 1232#(and (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~c~0)) 4294967296) 4294967296) ~c~0))) (or (< 1 (mod ~N~0 4294967296)) (= ~counter~0 (+ (* 2 ~c~0) (* (div (+ ~counter~0 (* (- 2) ~c~0)) 4294967296) 4294967296)))) (or (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)) (< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod ~N~0 4294967296))))]) [2023-08-26 20:13:31,921 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,921 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,921 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:31,921 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 20:13:58,554 INFO L124 PetriNetUnfolderBase]: 118719/156700 cut-off events. [2023-08-26 20:13:58,554 INFO L125 PetriNetUnfolderBase]: For 5543460/5552650 co-relation queries the response was YES. [2023-08-26 20:14:00,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421429 conditions, 156700 events. 118719/156700 cut-off events. For 5543460/5552650 co-relation queries the response was YES. Maximal size of possible extension queue 6977. Compared 1000362 event pairs, 24483 based on Foata normal form. 8112/162558 useless extension candidates. Maximal degree in co-relation 1421340. Up to 123067 conditions per place. [2023-08-26 20:14:01,564 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 2932 selfloop transitions, 262 changer transitions 228/3461 dead transitions. [2023-08-26 20:14:01,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3461 transitions, 68720 flow [2023-08-26 20:14:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 20:14:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 20:14:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2023-08-26 20:14:01,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698905109489051 [2023-08-26 20:14:01,593 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2023-08-26 20:14:01,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2023-08-26 20:14:01,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:14:01,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2023-08-26 20:14:01,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 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) [2023-08-26 20:14:01,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 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) [2023-08-26 20:14:01,597 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 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) [2023-08-26 20:14:01,597 INFO L175 Difference]: Start difference. First operand has 222 places, 2827 transitions, 50074 flow. Second operand 8 states and 1030 transitions. [2023-08-26 20:14:01,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 3461 transitions, 68720 flow