/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-channel-sum.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:50:13,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:50:13,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:50:13,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:50:13,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:50:13,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:50:13,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:50:13,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:50:13,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:50:13,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:50:13,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:50:13,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:50:13,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:50:13,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:50:13,989 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:50:13,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:50:13,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:50:13,990 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:50:13,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:50:13,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:50:13,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:50:13,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:50:13,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:50:13,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:50:14,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:50:14,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:50:14,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:50:14,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:50:14,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:50:14,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:50:14,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:50:14,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:50:14,003 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:50:14,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:50:14,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:50:14,004 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:50:14,004 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 02:50:14,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:50:14,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:50:14,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:50:14,263 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:50:14,265 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:50:14,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-channel-sum.wvr_bound2.c [2023-08-04 02:50:15,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:50:15,599 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:50:15,600 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-channel-sum.wvr_bound2.c [2023-08-04 02:50:15,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2314e8ff5/1a8f009aa7d744a194e9019aa94847e8/FLAG4c64a602d [2023-08-04 02:50:15,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2314e8ff5/1a8f009aa7d744a194e9019aa94847e8 [2023-08-04 02:50:15,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:50:15,635 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:50:15,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:50:15,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:50:15,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:50:15,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784ad3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15, skipping insertion in model container [2023-08-04 02:50:15,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:50:15,801 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-channel-sum.wvr_bound2.c[3109,3122] [2023-08-04 02:50:15,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:50:15,819 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:50:15,837 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-channel-sum.wvr_bound2.c[3109,3122] [2023-08-04 02:50:15,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:50:15,847 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:50:15,847 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:50:15,852 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:50:15,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15 WrapperNode [2023-08-04 02:50:15,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:50:15,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:50:15,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:50:15,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:50:15,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,887 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2023-08-04 02:50:15,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:50:15,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:50:15,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:50:15,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:50:15,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:50:15,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:50:15,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:50:15,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:50:15,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (1/1) ... [2023-08-04 02:50:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:50:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:15,959 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-04 02:50:15,961 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-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:50:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:50:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:50:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:50:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 02:50:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:50:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:50:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:50:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:50:15,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 02:50:16,082 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:50:16,084 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:50:16,324 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:50:16,387 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:50:16,387 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-04 02:50:16,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:50:16 BoogieIcfgContainer [2023-08-04 02:50:16,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:50:16,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:50:16,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:50:16,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:50:16,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:50:15" (1/3) ... [2023-08-04 02:50:16,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d399997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:50:16, skipping insertion in model container [2023-08-04 02:50:16,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:50:15" (2/3) ... [2023-08-04 02:50:16,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d399997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:50:16, skipping insertion in model container [2023-08-04 02:50:16,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:50:16" (3/3) ... [2023-08-04 02:50:16,396 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-channel-sum.wvr_bound2.c [2023-08-04 02:50:16,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:50:16,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:50:16,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:50:16,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:50:16,519 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:50:16,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,647 INFO L124 PetriNetUnfolderBase]: 39/312 cut-off events. [2023-08-04 02:50:16,647 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:50:16,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 312 events. 39/312 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1041 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 02:50:16,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,676 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:50:16,683 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,686 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 165 transitions, 352 flow [2023-08-04 02:50:16,765 INFO L124 PetriNetUnfolderBase]: 39/312 cut-off events. [2023-08-04 02:50:16,765 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:50:16,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 312 events. 39/312 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1041 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 183. Up to 8 conditions per place. [2023-08-04 02:50:16,771 INFO L119 LiptonReduction]: Number of co-enabled transitions 4950 [2023-08-04 02:50:20,673 INFO L134 LiptonReduction]: Checked pairs total: 7679 [2023-08-04 02:50:20,673 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-04 02:50:20,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:50:20,690 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=true, 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;@7cc3ab69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:50:20,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:50:20,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:50:20,695 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-08-04 02:50:20,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:50:20,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:20,696 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 02:50:20,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:50:20,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1617173283, now seen corresponding path program 1 times [2023-08-04 02:50:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050538251] [2023-08-04 02:50:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:50:20,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:50:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:50:20,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:50:20,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:50:20,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:50:20,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:50:20,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:50:20,865 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 02:50:20,867 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:50:20,868 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:50:20,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:50:20,894 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:50:20,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,004 INFO L124 PetriNetUnfolderBase]: 145/926 cut-off events. [2023-08-04 02:50:21,004 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:50:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 926 events. 145/926 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4786 event pairs, 1 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 558. Up to 32 conditions per place. [2023-08-04 02:50:21,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,017 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:50:21,017 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,017 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:21,138 INFO L124 PetriNetUnfolderBase]: 145/926 cut-off events. [2023-08-04 02:50:21,139 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:50:21,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 926 events. 145/926 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4786 event pairs, 1 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 558. Up to 32 conditions per place. [2023-08-04 02:50:21,167 INFO L119 LiptonReduction]: Number of co-enabled transitions 13556 [2023-08-04 02:50:25,075 INFO L134 LiptonReduction]: Checked pairs total: 36662 [2023-08-04 02:50:25,075 INFO L136 LiptonReduction]: Total number of compositions: 179 [2023-08-04 02:50:25,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:50:25,078 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=true, 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;@7cc3ab69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:50:25,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:50:25,086 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:50:25,086 INFO L124 PetriNetUnfolderBase]: 12/94 cut-off events. [2023-08-04 02:50:25,086 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:50:25,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:25,087 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:50:25,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:50:25,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1788784028, now seen corresponding path program 1 times [2023-08-04 02:50:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423631400] [2023-08-04 02:50:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:50:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423631400] [2023-08-04 02:50:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423631400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:50:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867940728] [2023-08-04 02:50:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:25,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:25,237 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-04 02:50:25,259 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-04 02:50:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:25,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:50:25,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:50:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:50:25,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:50:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867940728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:50:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:50:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:50:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337084592] [2023-08-04 02:50:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:50:25,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:50:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:50:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:50:25,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 388 [2023-08-04 02:50:25,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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-04 02:50:25,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:25,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 388 [2023-08-04 02:50:25,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:32,968 INFO L124 PetriNetUnfolderBase]: 84863/110172 cut-off events. [2023-08-04 02:50:32,968 INFO L125 PetriNetUnfolderBase]: For 7087/7087 co-relation queries the response was YES. [2023-08-04 02:50:33,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221679 conditions, 110172 events. 84863/110172 cut-off events. For 7087/7087 co-relation queries the response was YES. Maximal size of possible extension queue 4227. Compared 686449 event pairs, 30624 based on Foata normal form. 3092/75844 useless extension candidates. Maximal degree in co-relation 45248. Up to 107055 conditions per place. [2023-08-04 02:50:33,635 INFO L140 encePairwiseOnDemand]: 381/388 looper letters, 64 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2023-08-04 02:50:33,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 352 flow [2023-08-04 02:50:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:50:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:50:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2023-08-04 02:50:33,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695876288659794 [2023-08-04 02:50:33,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 911 transitions. [2023-08-04 02:50:33,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 911 transitions. [2023-08-04 02:50:33,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:33,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 911 transitions. [2023-08-04 02:50:33,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 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-04 02:50:33,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 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-04 02:50:33,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 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-04 02:50:33,682 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 188 flow. Second operand 5 states and 911 transitions. [2023-08-04 02:50:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 352 flow [2023-08-04 02:50:33,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:50:33,694 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 193 flow [2023-08-04 02:50:33,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-04 02:50:33,699 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2023-08-04 02:50:33,699 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 193 flow [2023-08-04 02:50:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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-04 02:50:33,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:33,700 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 02:50:33,709 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-04 02:50:33,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:33,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:50:33,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -913724523, now seen corresponding path program 1 times [2023-08-04 02:50:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895487022] [2023-08-04 02:50:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:50:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895487022] [2023-08-04 02:50:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895487022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:50:34,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:50:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:50:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938661830] [2023-08-04 02:50:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:50:34,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:50:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:34,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:50:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:50:34,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 388 [2023-08-04 02:50:34,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-04 02:50:34,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:34,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 388 [2023-08-04 02:50:34,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:40,364 INFO L124 PetriNetUnfolderBase]: 93764/118418 cut-off events. [2023-08-04 02:50:40,364 INFO L125 PetriNetUnfolderBase]: For 6010/6010 co-relation queries the response was YES. [2023-08-04 02:50:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237959 conditions, 118418 events. 93764/118418 cut-off events. For 6010/6010 co-relation queries the response was YES. Maximal size of possible extension queue 4093. Compared 670159 event pairs, 45885 based on Foata normal form. 1/75084 useless extension candidates. Maximal degree in co-relation 37855. Up to 115907 conditions per place. [2023-08-04 02:50:40,892 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 54 selfloop transitions, 2 changer transitions 2/74 dead transitions. [2023-08-04 02:50:40,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 318 flow [2023-08-04 02:50:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:50:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:50:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-08-04 02:50:40,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48281786941580757 [2023-08-04 02:50:40,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-08-04 02:50:40,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-08-04 02:50:40,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:40,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-08-04 02:50:40,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-04 02:50:40,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 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-04 02:50:40,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 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-04 02:50:40,901 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 193 flow. Second operand 3 states and 562 transitions. [2023-08-04 02:50:40,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 318 flow [2023-08-04 02:50:40,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:50:40,909 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 181 flow [2023-08-04 02:50:40,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-08-04 02:50:40,909 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-08-04 02:50:40,910 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 181 flow [2023-08-04 02:50:40,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-04 02:50:40,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:40,910 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:50:40,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:50:40,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:50:40,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash -439726740, now seen corresponding path program 1 times [2023-08-04 02:50:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349843972] [2023-08-04 02:50:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:50:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:41,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349843972] [2023-08-04 02:50:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349843972] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:50:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875544430] [2023-08-04 02:50:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:41,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:41,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:41,023 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-04 02:50:41,025 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-04 02:50:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:41,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:50:41,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:50:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:50:41,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:50:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:50:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875544430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:50:41,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:50:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:50:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758922947] [2023-08-04 02:50:41,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:50:41,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:50:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:50:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:50:41,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 388 [2023-08-04 02:50:41,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-04 02:50:41,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:41,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 388 [2023-08-04 02:50:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:46,241 INFO L124 PetriNetUnfolderBase]: 72424/92813 cut-off events. [2023-08-04 02:50:46,242 INFO L125 PetriNetUnfolderBase]: For 3498/3498 co-relation queries the response was YES. [2023-08-04 02:50:46,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186257 conditions, 92813 events. 72424/92813 cut-off events. For 3498/3498 co-relation queries the response was YES. Maximal size of possible extension queue 3745. Compared 543371 event pairs, 25374 based on Foata normal form. 6/61032 useless extension candidates. Maximal degree in co-relation 38253. Up to 90895 conditions per place. [2023-08-04 02:50:46,672 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 62 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-04 02:50:46,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 340 flow [2023-08-04 02:50:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:50:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:50:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2023-08-04 02:50:46,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729381443298969 [2023-08-04 02:50:46,675 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2023-08-04 02:50:46,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2023-08-04 02:50:46,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:46,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2023-08-04 02:50:46,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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-04 02:50:46,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 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-04 02:50:46,681 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 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-04 02:50:46,681 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 181 flow. Second operand 4 states and 734 transitions. [2023-08-04 02:50:46,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 340 flow [2023-08-04 02:50:46,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:50:46,685 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 178 flow [2023-08-04 02:50:46,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2023-08-04 02:50:46,687 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-04 02:50:46,688 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 178 flow [2023-08-04 02:50:46,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-04 02:50:46,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:46,693 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:50:46,701 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-04 02:50:46,897 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,SelfDestructingSolverStorable3 [2023-08-04 02:50:46,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:50:46,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1400507038, now seen corresponding path program 1 times [2023-08-04 02:50:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066395660] [2023-08-04 02:50:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:50:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066395660] [2023-08-04 02:50:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066395660] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:50:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164579083] [2023-08-04 02:50:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:47,004 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-04 02:50:47,008 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-04 02:50:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:47,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:50:47,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:50:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:50:47,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:50:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164579083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:50:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:50:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:50:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023287730] [2023-08-04 02:50:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:50:47,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:50:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:50:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:50:47,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 388 [2023-08-04 02:50:47,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-04 02:50:47,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:47,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 388 [2023-08-04 02:50:47,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:52,111 INFO L124 PetriNetUnfolderBase]: 78736/97840 cut-off events. [2023-08-04 02:50:52,111 INFO L125 PetriNetUnfolderBase]: For 2060/2060 co-relation queries the response was YES. [2023-08-04 02:50:52,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195762 conditions, 97840 events. 78736/97840 cut-off events. For 2060/2060 co-relation queries the response was YES. Maximal size of possible extension queue 3423. Compared 534601 event pairs, 1798 based on Foata normal form. 0/62262 useless extension candidates. Maximal degree in co-relation 100657. Up to 85580 conditions per place. [2023-08-04 02:50:52,343 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 0 selfloop transitions, 0 changer transitions 117/117 dead transitions. [2023-08-04 02:50:52,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 117 transitions, 482 flow [2023-08-04 02:50:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:50:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:50:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 937 transitions. [2023-08-04 02:50:52,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829896907216495 [2023-08-04 02:50:52,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 937 transitions. [2023-08-04 02:50:52,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 937 transitions. [2023-08-04 02:50:52,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:52,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 937 transitions. [2023-08-04 02:50:52,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.4) internal successors, (937), 5 states have internal predecessors, (937), 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-04 02:50:52,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 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-04 02:50:52,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 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-04 02:50:52,358 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 178 flow. Second operand 5 states and 937 transitions. [2023-08-04 02:50:52,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 117 transitions, 482 flow [2023-08-04 02:50:52,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-04 02:50:52,377 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2023-08-04 02:50:52,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2023-08-04 02:50:52,379 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2023-08-04 02:50:52,379 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2023-08-04 02:50:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-04 02:50:52,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:50:52,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:50:52,389 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-04 02:50:52,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:52,585 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:50:52,586 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:50:52,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,664 INFO L124 PetriNetUnfolderBase]: 145/926 cut-off events. [2023-08-04 02:50:52,664 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:50:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 926 events. 145/926 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4786 event pairs, 1 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 558. Up to 32 conditions per place. [2023-08-04 02:50:52,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,673 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:50:52,673 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,674 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 209 transitions, 466 flow [2023-08-04 02:50:52,943 INFO L124 PetriNetUnfolderBase]: 145/926 cut-off events. [2023-08-04 02:50:52,943 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:50:52,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 926 events. 145/926 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4786 event pairs, 1 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 558. Up to 32 conditions per place. [2023-08-04 02:50:52,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 13556 [2023-08-04 02:50:56,602 INFO L134 LiptonReduction]: Checked pairs total: 36279 [2023-08-04 02:50:56,602 INFO L136 LiptonReduction]: Total number of compositions: 176 [2023-08-04 02:50:56,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:50:56,607 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=true, 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;@7cc3ab69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:50:56,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:50:56,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:50:56,608 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 02:50:56,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:50:56,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:56,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 02:50:56,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:50:56,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash -29672025, now seen corresponding path program 1 times [2023-08-04 02:50:56,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:56,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63976419] [2023-08-04 02:50:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:56,647 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-04 02:50:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63976419] [2023-08-04 02:50:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63976419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:50:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:50:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:50:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750940968] [2023-08-04 02:50:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:50:56,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:50:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:50:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:50:56,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 385 [2023-08-04 02:50:56,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-04 02:50:56,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:56,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 385 [2023-08-04 02:50:56,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:02,751 INFO L124 PetriNetUnfolderBase]: 93957/118959 cut-off events. [2023-08-04 02:51:02,751 INFO L125 PetriNetUnfolderBase]: For 7346/7346 co-relation queries the response was YES. [2023-08-04 02:51:02,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239468 conditions, 118959 events. 93957/118959 cut-off events. For 7346/7346 co-relation queries the response was YES. Maximal size of possible extension queue 4087. Compared 677372 event pairs, 45957 based on Foata normal form. 3104/78506 useless extension candidates. Maximal degree in co-relation 50088. Up to 116166 conditions per place. [2023-08-04 02:51:03,260 INFO L140 encePairwiseOnDemand]: 380/385 looper letters, 55 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-04 02:51:03,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 310 flow [2023-08-04 02:51:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:51:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:51:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-08-04 02:51:03,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883116883116883 [2023-08-04 02:51:03,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-08-04 02:51:03,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-08-04 02:51:03,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:03,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-08-04 02:51:03,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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-04 02:51:03,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:03,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:03,267 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 186 flow. Second operand 3 states and 564 transitions. [2023-08-04 02:51:03,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 310 flow [2023-08-04 02:51:03,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:51:03,273 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 194 flow [2023-08-04 02:51:03,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2023-08-04 02:51:03,274 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-08-04 02:51:03,274 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 194 flow [2023-08-04 02:51:03,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-04 02:51:03,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:03,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:03,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 02:51:03,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:03,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1148827100, now seen corresponding path program 1 times [2023-08-04 02:51:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116109685] [2023-08-04 02:51:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:51:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116109685] [2023-08-04 02:51:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116109685] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765656497] [2023-08-04 02:51:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:03,307 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-04 02:51:03,314 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-04 02:51:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:03,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:51:03,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:51:03,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:51:03,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765656497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:51:03,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:51:03,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:51:03,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492675905] [2023-08-04 02:51:03,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:51:03,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:51:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:03,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:51:03,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:03,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 385 [2023-08-04 02:51:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-04 02:51:03,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 385 [2023-08-04 02:51:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:09,874 INFO L124 PetriNetUnfolderBase]: 100278/125541 cut-off events. [2023-08-04 02:51:09,875 INFO L125 PetriNetUnfolderBase]: For 6986/6986 co-relation queries the response was YES. [2023-08-04 02:51:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252432 conditions, 125541 events. 100278/125541 cut-off events. For 6986/6986 co-relation queries the response was YES. Maximal size of possible extension queue 4136. Compared 693447 event pairs, 49011 based on Foata normal form. 0/78517 useless extension candidates. Maximal degree in co-relation 151746. Up to 121410 conditions per place. [2023-08-04 02:51:10,476 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 67 selfloop transitions, 2 changer transitions 2/86 dead transitions. [2023-08-04 02:51:10,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 368 flow [2023-08-04 02:51:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:51:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:51:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-08-04 02:51:10,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4961038961038961 [2023-08-04 02:51:10,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-08-04 02:51:10,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-08-04 02:51:10,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:10,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-08-04 02:51:10,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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-04 02:51:10,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:10,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:10,483 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 194 flow. Second operand 3 states and 573 transitions. [2023-08-04 02:51:10,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 368 flow [2023-08-04 02:51:10,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:51:10,491 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 192 flow [2023-08-04 02:51:10,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2023-08-04 02:51:10,492 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-08-04 02:51:10,492 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 192 flow [2023-08-04 02:51:10,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-04 02:51:10,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:10,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:10,497 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-04 02:51:10,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:10,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:10,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1378708261, now seen corresponding path program 1 times [2023-08-04 02:51:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40041178] [2023-08-04 02:51:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:10,729 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-04 02:51:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40041178] [2023-08-04 02:51:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40041178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545775591] [2023-08-04 02:51:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:10,732 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-04 02:51:10,762 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-04 02:51:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:10,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:51:10,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 02:51:10,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:51:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545775591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:51:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:51:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:51:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662722184] [2023-08-04 02:51:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:51:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:51:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:51:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:10,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 385 [2023-08-04 02:51:10,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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-04 02:51:10,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:10,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 385 [2023-08-04 02:51:10,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:15,845 INFO L124 PetriNetUnfolderBase]: 75791/96134 cut-off events. [2023-08-04 02:51:15,845 INFO L125 PetriNetUnfolderBase]: For 6675/6675 co-relation queries the response was YES. [2023-08-04 02:51:16,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197199 conditions, 96134 events. 75791/96134 cut-off events. For 6675/6675 co-relation queries the response was YES. Maximal size of possible extension queue 2929. Compared 545071 event pairs, 31857 based on Foata normal form. 0/63835 useless extension candidates. Maximal degree in co-relation 80127. Up to 64386 conditions per place. [2023-08-04 02:51:16,433 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 79 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-04 02:51:16,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 424 flow [2023-08-04 02:51:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:51:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:51:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-08-04 02:51:16,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056277056277056 [2023-08-04 02:51:16,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-08-04 02:51:16,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-08-04 02:51:16,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:16,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-08-04 02:51:16,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-04 02:51:16,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:16,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:16,438 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 192 flow. Second operand 3 states and 584 transitions. [2023-08-04 02:51:16,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 424 flow [2023-08-04 02:51:16,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:51:16,448 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 196 flow [2023-08-04 02:51:16,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2023-08-04 02:51:16,449 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-08-04 02:51:16,449 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 196 flow [2023-08-04 02:51:16,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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-04 02:51:16,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:16,449 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] [2023-08-04 02:51:16,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 02:51:16,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:16,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:16,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1602886271, now seen corresponding path program 1 times [2023-08-04 02:51:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530541147] [2023-08-04 02:51:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:16,693 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-04 02:51:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530541147] [2023-08-04 02:51:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530541147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273825440] [2023-08-04 02:51:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:16,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:16,696 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-04 02:51:16,723 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-04 02:51:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:16,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:51:16,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:51:16,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:51:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273825440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:51:16,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:51:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 02:51:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87298236] [2023-08-04 02:51:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:51:16,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:51:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:51:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:16,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 385 [2023-08-04 02:51:16,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-04 02:51:16,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:16,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 385 [2023-08-04 02:51:16,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:21,313 INFO L124 PetriNetUnfolderBase]: 73103/92871 cut-off events. [2023-08-04 02:51:21,313 INFO L125 PetriNetUnfolderBase]: For 17301/17301 co-relation queries the response was YES. [2023-08-04 02:51:21,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196264 conditions, 92871 events. 73103/92871 cut-off events. For 17301/17301 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 517641 event pairs, 39784 based on Foata normal form. 0/63667 useless extension candidates. Maximal degree in co-relation 79328. Up to 77959 conditions per place. [2023-08-04 02:51:21,880 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 80 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-08-04 02:51:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 428 flow [2023-08-04 02:51:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:51:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:51:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-08-04 02:51:21,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056277056277056 [2023-08-04 02:51:21,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-08-04 02:51:21,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-08-04 02:51:21,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:21,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-08-04 02:51:21,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-04 02:51:21,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:21,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:51:21,886 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 196 flow. Second operand 3 states and 584 transitions. [2023-08-04 02:51:21,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 428 flow [2023-08-04 02:51:22,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:51:22,145 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 206 flow [2023-08-04 02:51:22,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-08-04 02:51:22,146 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-08-04 02:51:22,146 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 206 flow [2023-08-04 02:51:22,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-04 02:51:22,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:22,147 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-04 02:51:22,151 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-04 02:51:22,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:22,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:22,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2076626993, now seen corresponding path program 1 times [2023-08-04 02:51:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264923410] [2023-08-04 02:51:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:51:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264923410] [2023-08-04 02:51:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264923410] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837491312] [2023-08-04 02:51:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:22,414 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-04 02:51:22,416 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-04 02:51:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:22,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:51:22,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:51:22,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:51:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:51:22,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837491312] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:51:22,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:51:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:51:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35368861] [2023-08-04 02:51:22,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:51:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:51:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:51:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:22,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 385 [2023-08-04 02:51:22,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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-04 02:51:22,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:22,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 385 [2023-08-04 02:51:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:26,270 INFO L124 PetriNetUnfolderBase]: 56517/74309 cut-off events. [2023-08-04 02:51:26,270 INFO L125 PetriNetUnfolderBase]: For 12994/12994 co-relation queries the response was YES. [2023-08-04 02:51:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159253 conditions, 74309 events. 56517/74309 cut-off events. For 12994/12994 co-relation queries the response was YES. Maximal size of possible extension queue 2762. Compared 454458 event pairs, 20369 based on Foata normal form. 6/54028 useless extension candidates. Maximal degree in co-relation 127652. Up to 72260 conditions per place. [2023-08-04 02:51:26,602 INFO L140 encePairwiseOnDemand]: 381/385 looper letters, 67 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-04 02:51:26,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 382 flow [2023-08-04 02:51:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:51:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:51:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions. [2023-08-04 02:51:26,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2023-08-04 02:51:26,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 737 transitions. [2023-08-04 02:51:26,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions. [2023-08-04 02:51:26,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:26,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions. [2023-08-04 02:51:26,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 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-04 02:51:26,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:26,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:26,609 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 206 flow. Second operand 4 states and 737 transitions. [2023-08-04 02:51:26,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 382 flow [2023-08-04 02:51:27,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:51:27,622 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 224 flow [2023-08-04 02:51:27,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-08-04 02:51:27,622 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2023-08-04 02:51:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 224 flow [2023-08-04 02:51:27,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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-04 02:51:27,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:27,623 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:27,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 02:51:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:27,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:27,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1043737069, now seen corresponding path program 1 times [2023-08-04 02:51:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:27,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056135733] [2023-08-04 02:51:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:51:27,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:27,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056135733] [2023-08-04 02:51:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056135733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:27,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663109634] [2023-08-04 02:51:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:27,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:51:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 02:51:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:27,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:51:27,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:51:27,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:51:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:51:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663109634] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:51:27,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:51:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:51:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026110232] [2023-08-04 02:51:27,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:51:27,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:51:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:51:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:28,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 385 [2023-08-04 02:51:28,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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-04 02:51:28,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:28,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 385 [2023-08-04 02:51:28,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:32,321 INFO L124 PetriNetUnfolderBase]: 65578/83022 cut-off events. [2023-08-04 02:51:32,321 INFO L125 PetriNetUnfolderBase]: For 5788/5788 co-relation queries the response was YES. [2023-08-04 02:51:32,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175777 conditions, 83022 events. 65578/83022 cut-off events. For 5788/5788 co-relation queries the response was YES. Maximal size of possible extension queue 2645. Compared 462971 event pairs, 18466 based on Foata normal form. 216/57208 useless extension candidates. Maximal degree in co-relation 140825. Up to 61553 conditions per place. [2023-08-04 02:51:32,645 INFO L140 encePairwiseOnDemand]: 381/385 looper letters, 91 selfloop transitions, 3 changer transitions 2/111 dead transitions. [2023-08-04 02:51:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 498 flow [2023-08-04 02:51:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:51:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:51:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 761 transitions. [2023-08-04 02:51:32,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941558441558442 [2023-08-04 02:51:32,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 761 transitions. [2023-08-04 02:51:32,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 761 transitions. [2023-08-04 02:51:32,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:32,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 761 transitions. [2023-08-04 02:51:32,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 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-04 02:51:32,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:32,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:32,652 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 224 flow. Second operand 4 states and 761 transitions. [2023-08-04 02:51:32,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 498 flow [2023-08-04 02:51:33,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 494 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:51:33,621 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 228 flow [2023-08-04 02:51:33,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-04 02:51:33,621 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2023-08-04 02:51:33,621 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 228 flow [2023-08-04 02:51:33,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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-04 02:51:33,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:33,622 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:33,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-04 02:51:33,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 02:51:33,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:33,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1809174985, now seen corresponding path program 1 times [2023-08-04 02:51:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:33,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665755056] [2023-08-04 02:51:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:33,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:51:33,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665755056] [2023-08-04 02:51:33,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665755056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:33,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398572762] [2023-08-04 02:51:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:33,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:33,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:33,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:51:33,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 02:51:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:33,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:51:33,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:51:34,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:51:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:51:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398572762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:51:34,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:51:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:51:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771321394] [2023-08-04 02:51:34,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:51:34,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:51:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:51:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:34,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 385 [2023-08-04 02:51:34,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 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-04 02:51:34,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:34,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 385 [2023-08-04 02:51:34,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:37,342 INFO L124 PetriNetUnfolderBase]: 47042/59774 cut-off events. [2023-08-04 02:51:37,342 INFO L125 PetriNetUnfolderBase]: For 20325/20325 co-relation queries the response was YES. [2023-08-04 02:51:37,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131133 conditions, 59774 events. 47042/59774 cut-off events. For 20325/20325 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 321596 event pairs, 11114 based on Foata normal form. 972/41857 useless extension candidates. Maximal degree in co-relation 126208. Up to 23748 conditions per place. [2023-08-04 02:51:37,604 INFO L140 encePairwiseOnDemand]: 381/385 looper letters, 102 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2023-08-04 02:51:37,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 554 flow [2023-08-04 02:51:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:51:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:51:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2023-08-04 02:51:37,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2023-08-04 02:51:37,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2023-08-04 02:51:37,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2023-08-04 02:51:37,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:37,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2023-08-04 02:51:37,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-04 02:51:37,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:37,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:37,611 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 228 flow. Second operand 4 states and 772 transitions. [2023-08-04 02:51:37,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 554 flow [2023-08-04 02:51:37,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 538 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-04 02:51:37,789 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 234 flow [2023-08-04 02:51:37,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-08-04 02:51:37,790 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2023-08-04 02:51:37,790 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 234 flow [2023-08-04 02:51:37,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 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-04 02:51:37,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:37,791 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:37,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 02:51:37,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:37,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:37,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash -941108, now seen corresponding path program 1 times [2023-08-04 02:51:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234838420] [2023-08-04 02:51:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:51:38,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:38,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234838420] [2023-08-04 02:51:38,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234838420] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:38,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916393568] [2023-08-04 02:51:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:38,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:38,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:38,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:51:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 02:51:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:38,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:51:38,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:51:38,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:51:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:51:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916393568] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:51:38,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:51:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:51:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102788848] [2023-08-04 02:51:38,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:51:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:51:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:38,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:51:38,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:51:38,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 385 [2023-08-04 02:51:38,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 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-04 02:51:38,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:38,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 385 [2023-08-04 02:51:38,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:41,666 INFO L124 PetriNetUnfolderBase]: 47009/59717 cut-off events. [2023-08-04 02:51:41,666 INFO L125 PetriNetUnfolderBase]: For 28013/28013 co-relation queries the response was YES. [2023-08-04 02:51:41,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135260 conditions, 59717 events. 47009/59717 cut-off events. For 28013/28013 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 319834 event pairs, 28785 based on Foata normal form. 26/40867 useless extension candidates. Maximal degree in co-relation 130257. Up to 55892 conditions per place. [2023-08-04 02:51:41,893 INFO L140 encePairwiseOnDemand]: 381/385 looper letters, 99 selfloop transitions, 3 changer transitions 5/122 dead transitions. [2023-08-04 02:51:41,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 560 flow [2023-08-04 02:51:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:51:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:51:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2023-08-04 02:51:41,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2023-08-04 02:51:41,896 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2023-08-04 02:51:41,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2023-08-04 02:51:41,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:41,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2023-08-04 02:51:41,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-04 02:51:41,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:41,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:41,900 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 234 flow. Second operand 4 states and 772 transitions. [2023-08-04 02:51:41,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 560 flow [2023-08-04 02:51:42,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 556 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:51:42,318 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 236 flow [2023-08-04 02:51:42,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2023-08-04 02:51:42,318 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2023-08-04 02:51:42,318 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 236 flow [2023-08-04 02:51:42,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 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-04 02:51:42,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:42,319 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:42,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 02:51:42,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 02:51:42,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:42,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 747142987, now seen corresponding path program 1 times [2023-08-04 02:51:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:42,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530461218] [2023-08-04 02:51:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:51:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:42,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530461218] [2023-08-04 02:51:42,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530461218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:51:42,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:51:42,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:51:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517488672] [2023-08-04 02:51:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:51:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:51:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:51:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:51:42,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 385 [2023-08-04 02:51:42,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-04 02:51:42,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:42,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 385 [2023-08-04 02:51:42,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:50,954 INFO L124 PetriNetUnfolderBase]: 101842/134687 cut-off events. [2023-08-04 02:51:50,954 INFO L125 PetriNetUnfolderBase]: For 64184/64184 co-relation queries the response was YES. [2023-08-04 02:51:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299663 conditions, 134687 events. 101842/134687 cut-off events. For 64184/64184 co-relation queries the response was YES. Maximal size of possible extension queue 4209. Compared 871461 event pairs, 39884 based on Foata normal form. 2/101060 useless extension candidates. Maximal degree in co-relation 298742. Up to 59162 conditions per place. [2023-08-04 02:51:51,639 INFO L140 encePairwiseOnDemand]: 380/385 looper letters, 147 selfloop transitions, 6 changer transitions 2/169 dead transitions. [2023-08-04 02:51:51,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 934 flow [2023-08-04 02:51:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:51:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:51:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2023-08-04 02:51:51,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253246753246753 [2023-08-04 02:51:51,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 809 transitions. [2023-08-04 02:51:51,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 809 transitions. [2023-08-04 02:51:51,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:51,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 809 transitions. [2023-08-04 02:51:51,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 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-04 02:51:51,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:51,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:51:51,645 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 236 flow. Second operand 4 states and 809 transitions. [2023-08-04 02:51:51,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 934 flow [2023-08-04 02:51:53,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 910 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-04 02:51:53,173 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 267 flow [2023-08-04 02:51:53,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-08-04 02:51:53,173 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2023-08-04 02:51:53,173 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 267 flow [2023-08-04 02:51:53,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-04 02:51:53,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:53,174 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:53,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 02:51:53,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:53,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1937981134, now seen corresponding path program 1 times [2023-08-04 02:51:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053986737] [2023-08-04 02:51:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:51:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053986737] [2023-08-04 02:51:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053986737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:51:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:51:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:51:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314044370] [2023-08-04 02:51:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:51:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:51:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:51:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:51:53,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 385 [2023-08-04 02:51:53,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 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-04 02:51:53,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:53,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 385 [2023-08-04 02:51:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:52:06,063 INFO L124 PetriNetUnfolderBase]: 150693/197192 cut-off events. [2023-08-04 02:52:06,064 INFO L125 PetriNetUnfolderBase]: For 87638/87638 co-relation queries the response was YES. [2023-08-04 02:52:06,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454597 conditions, 197192 events. 150693/197192 cut-off events. For 87638/87638 co-relation queries the response was YES. Maximal size of possible extension queue 5791. Compared 1313904 event pairs, 29235 based on Foata normal form. 0/150690 useless extension candidates. Maximal degree in co-relation 453190. Up to 166876 conditions per place. [2023-08-04 02:52:07,433 INFO L140 encePairwiseOnDemand]: 377/385 looper letters, 123 selfloop transitions, 12 changer transitions 6/155 dead transitions. [2023-08-04 02:52:07,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 155 transitions, 859 flow [2023-08-04 02:52:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:52:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:52:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 781 transitions. [2023-08-04 02:52:07,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2023-08-04 02:52:07,435 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 781 transitions. [2023-08-04 02:52:07,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 781 transitions. [2023-08-04 02:52:07,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:52:07,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 781 transitions. [2023-08-04 02:52:07,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 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-04 02:52:07,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:52:07,439 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:52:07,439 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 267 flow. Second operand 4 states and 781 transitions. [2023-08-04 02:52:07,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 155 transitions, 859 flow [2023-08-04 02:52:08,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 155 transitions, 859 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:52:08,311 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 340 flow [2023-08-04 02:52:08,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2023-08-04 02:52:08,312 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2023-08-04 02:52:08,312 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 340 flow [2023-08-04 02:52:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 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-04 02:52:08,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:52:08,312 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:52:08,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 02:52:08,312 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:52:08,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:52:08,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1183228629, now seen corresponding path program 1 times [2023-08-04 02:52:08,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:52:08,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812401325] [2023-08-04 02:52:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:52:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:52:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:52:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:52:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:52:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812401325] [2023-08-04 02:52:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812401325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:52:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:52:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:52:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849329728] [2023-08-04 02:52:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:52:08,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:52:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:52:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:52:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:52:08,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 385 [2023-08-04 02:52:08,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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-04 02:52:08,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:52:08,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 385 [2023-08-04 02:52:08,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:52:21,464 INFO L124 PetriNetUnfolderBase]: 151606/203255 cut-off events. [2023-08-04 02:52:21,464 INFO L125 PetriNetUnfolderBase]: For 117674/119008 co-relation queries the response was YES. [2023-08-04 02:52:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501635 conditions, 203255 events. 151606/203255 cut-off events. For 117674/119008 co-relation queries the response was YES. Maximal size of possible extension queue 5524. Compared 1407545 event pairs, 37509 based on Foata normal form. 1334/163357 useless extension candidates. Maximal degree in co-relation 500179. Up to 176737 conditions per place. [2023-08-04 02:52:22,971 INFO L140 encePairwiseOnDemand]: 378/385 looper letters, 109 selfloop transitions, 18 changer transitions 10/152 dead transitions. [2023-08-04 02:52:22,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 152 transitions, 896 flow [2023-08-04 02:52:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:52:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:52:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 770 transitions. [2023-08-04 02:52:22,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 02:52:22,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 770 transitions. [2023-08-04 02:52:22,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 770 transitions. [2023-08-04 02:52:22,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:52:22,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 770 transitions. [2023-08-04 02:52:22,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 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-04 02:52:22,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:52:22,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:52:22,978 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 340 flow. Second operand 4 states and 770 transitions. [2023-08-04 02:52:22,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 152 transitions, 896 flow [2023-08-04 02:52:23,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 152 transitions, 896 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:52:23,588 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 431 flow [2023-08-04 02:52:23,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2023-08-04 02:52:23,589 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2023-08-04 02:52:23,589 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 431 flow [2023-08-04 02:52:23,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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-04 02:52:23,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:52:23,589 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:52:23,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 02:52:23,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:52:23,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:52:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1126369207, now seen corresponding path program 1 times [2023-08-04 02:52:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:52:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300563014] [2023-08-04 02:52:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:52:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:52:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:52:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:52:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:52:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300563014] [2023-08-04 02:52:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300563014] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:52:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916415219] [2023-08-04 02:52:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:52:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:52:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:52:23,789 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:52:23,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 02:52:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:52:23,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:52:23,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:52:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:52:24,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:52:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:52:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916415219] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:52:24,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:52:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2023-08-04 02:52:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20523015] [2023-08-04 02:52:24,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:52:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 02:52:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:52:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 02:52:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-04 02:52:24,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 385 [2023-08-04 02:52:24,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 431 flow. Second operand has 9 states, 9 states have (on average 166.88888888888889) internal successors, (1502), 9 states have internal predecessors, (1502), 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-04 02:52:24,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:52:24,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 385 [2023-08-04 02:52:24,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:53:06,014 INFO L124 PetriNetUnfolderBase]: 438347/580522 cut-off events. [2023-08-04 02:53:06,015 INFO L125 PetriNetUnfolderBase]: For 374481/374541 co-relation queries the response was YES. [2023-08-04 02:53:08,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452351 conditions, 580522 events. 438347/580522 cut-off events. For 374481/374541 co-relation queries the response was YES. Maximal size of possible extension queue 15342. Compared 4325298 event pairs, 38216 based on Foata normal form. 10836/488529 useless extension candidates. Maximal degree in co-relation 1448000. Up to 163264 conditions per place. [2023-08-04 02:53:10,178 INFO L140 encePairwiseOnDemand]: 370/385 looper letters, 452 selfloop transitions, 84 changer transitions 8/556 dead transitions. [2023-08-04 02:53:10,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 556 transitions, 3341 flow [2023-08-04 02:53:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 02:53:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 02:53:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2866 transitions. [2023-08-04 02:53:10,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49627705627705626 [2023-08-04 02:53:10,182 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2866 transitions. [2023-08-04 02:53:10,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2866 transitions. [2023-08-04 02:53:10,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:53:10,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2866 transitions. [2023-08-04 02:53:10,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 191.06666666666666) internal successors, (2866), 15 states have internal predecessors, (2866), 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-04 02:53:10,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 385.0) internal successors, (6160), 16 states have internal predecessors, (6160), 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-04 02:53:10,194 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 385.0) internal successors, (6160), 16 states have internal predecessors, (6160), 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-04 02:53:10,194 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 431 flow. Second operand 15 states and 2866 transitions. [2023-08-04 02:53:10,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 556 transitions, 3341 flow [2023-08-04 02:53:15,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 556 transitions, 3324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:53:15,980 INFO L231 Difference]: Finished difference. Result has 112 places, 164 transitions, 1048 flow [2023-08-04 02:53:15,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1048, PETRI_PLACES=112, PETRI_TRANSITIONS=164} [2023-08-04 02:53:15,980 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 50 predicate places. [2023-08-04 02:53:15,980 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 164 transitions, 1048 flow [2023-08-04 02:53:15,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 166.88888888888889) internal successors, (1502), 9 states have internal predecessors, (1502), 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-04 02:53:15,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:53:15,981 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:53:15,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 02:53:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 02:53:16,186 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:53:16,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:53:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1108141579, now seen corresponding path program 2 times [2023-08-04 02:53:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:53:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990163608] [2023-08-04 02:53:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:53:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:53:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:53:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-04 02:53:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:53:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990163608] [2023-08-04 02:53:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990163608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:53:16,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:53:16,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:53:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065402091] [2023-08-04 02:53:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:53:16,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:53:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:53:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:53:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:53:16,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 385 [2023-08-04 02:53:16,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 164 transitions, 1048 flow. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 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-04 02:53:16,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:53:16,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 385 [2023-08-04 02:53:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:53:48,704 INFO L124 PetriNetUnfolderBase]: 256490/343258 cut-off events. [2023-08-04 02:53:48,704 INFO L125 PetriNetUnfolderBase]: For 706481/720473 co-relation queries the response was YES. [2023-08-04 02:53:50,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078195 conditions, 343258 events. 256490/343258 cut-off events. For 706481/720473 co-relation queries the response was YES. Maximal size of possible extension queue 9510. Compared 2490709 event pairs, 152194 based on Foata normal form. 7365/286365 useless extension candidates. Maximal degree in co-relation 1074988. Up to 318798 conditions per place. [2023-08-04 02:53:51,866 INFO L140 encePairwiseOnDemand]: 379/385 looper letters, 131 selfloop transitions, 2 changer transitions 32/194 dead transitions. [2023-08-04 02:53:51,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 194 transitions, 1534 flow [2023-08-04 02:53:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:53:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:53:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 745 transitions. [2023-08-04 02:53:51,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2023-08-04 02:53:51,868 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 745 transitions. [2023-08-04 02:53:51,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 745 transitions. [2023-08-04 02:53:51,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:53:51,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 745 transitions. [2023-08-04 02:53:51,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.25) internal successors, (745), 4 states have internal predecessors, (745), 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-04 02:53:51,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:53:51,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 385.0) internal successors, (1925), 5 states have internal predecessors, (1925), 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-04 02:53:51,871 INFO L175 Difference]: Start difference. First operand has 112 places, 164 transitions, 1048 flow. Second operand 4 states and 745 transitions. [2023-08-04 02:53:51,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 194 transitions, 1534 flow [2023-08-04 02:54:13,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 194 transitions, 1414 flow, removed 49 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:13,515 INFO L231 Difference]: Finished difference. Result has 115 places, 162 transitions, 932 flow [2023-08-04 02:54:13,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=932, PETRI_PLACES=115, PETRI_TRANSITIONS=162} [2023-08-04 02:54:13,515 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places. [2023-08-04 02:54:13,516 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 932 flow [2023-08-04 02:54:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 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-04 02:54:13,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:13,516 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:13,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 02:54:13,516 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:13,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash 42078736, now seen corresponding path program 1 times [2023-08-04 02:54:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376902806] [2023-08-04 02:54:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:54:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376902806] [2023-08-04 02:54:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376902806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:13,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:13,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:54:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381306618] [2023-08-04 02:54:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:13,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:13,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 385 [2023-08-04 02:54:13,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-04 02:54:13,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:13,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 385 [2023-08-04 02:54:13,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:07,350 INFO L124 PetriNetUnfolderBase]: 382767/510541 cut-off events. [2023-08-04 02:55:07,350 INFO L125 PetriNetUnfolderBase]: For 1004231/1022976 co-relation queries the response was YES. [2023-08-04 02:55:11,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636337 conditions, 510541 events. 382767/510541 cut-off events. For 1004231/1022976 co-relation queries the response was YES. Maximal size of possible extension queue 14382. Compared 3881630 event pairs, 150534 based on Foata normal form. 12702/483905 useless extension candidates. Maximal degree in co-relation 1636292. Up to 307706 conditions per place. [2023-08-04 02:55:14,013 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 214 selfloop transitions, 17 changer transitions 0/259 dead transitions. [2023-08-04 02:55:14,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 259 transitions, 1926 flow [2023-08-04 02:55:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:55:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:55:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2023-08-04 02:55:14,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516017316017316 [2023-08-04 02:55:14,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2023-08-04 02:55:14,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2023-08-04 02:55:14,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:14,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2023-08-04 02:55:14,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-04 02:55:14,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:55:14,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:55:14,175 INFO L175 Difference]: Start difference. First operand has 115 places, 162 transitions, 932 flow. Second operand 3 states and 596 transitions. [2023-08-04 02:55:14,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 259 transitions, 1926 flow [2023-08-04 02:56:12,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 259 transitions, 1916 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 02:56:12,562 INFO L231 Difference]: Finished difference. Result has 115 places, 170 transitions, 1031 flow [2023-08-04 02:56:12,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=115, PETRI_TRANSITIONS=170} [2023-08-04 02:56:12,562 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places. [2023-08-04 02:56:12,562 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 170 transitions, 1031 flow [2023-08-04 02:56:12,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-04 02:56:12,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:12,563 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:56:12,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 02:56:12,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:12,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1241072996, now seen corresponding path program 1 times [2023-08-04 02:56:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793156495] [2023-08-04 02:56:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:56:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793156495] [2023-08-04 02:56:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793156495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:56:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:56:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:56:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223802503] [2023-08-04 02:56:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:12,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:56:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:56:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:56:12,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 385 [2023-08-04 02:56:12,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 170 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-04 02:56:12,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:12,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 385 [2023-08-04 02:56:12,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:57:12,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:12,788 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-04 02:57:12,788 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:12,788 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:12,788 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 02:57:12,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:12,788 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-04 02:57:12,788 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 02:57:12,789 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:12,789 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:14,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,009 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,009 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,010 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,010 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 02:57:14,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,011 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 77#thread2EXITtrue, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,012 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:14,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 77#thread2EXITtrue, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,013 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#thread1EXITtrue, Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,013 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 77#thread2EXITtrue, Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,013 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,013 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,013 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 35#L65-5true, thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,014 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 499#true, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 35#L65-5true, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,014 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,014 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 77#thread2EXITtrue, Black: 499#true, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 35#L65-5true, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,015 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 35#L65-5true, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,015 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 77#thread2EXITtrue, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,015 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,015 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 77#thread2EXITtrue, Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), 10#L38true, Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,016 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), 10#L38true, Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,016 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,016 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,017 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,627 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,627 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,627 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,627 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,628 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,628 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,628 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,628 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1180] L72-->L65-5: Formula: (and (= v_~back~0_172 (+ v_~back~0_173 1)) (= (ite (= (ite (= (mod |v_thread2Thread1of2ForFork1_~flag~0#1_35| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of2ForFork1_~flag~0#1_34|)) InVars {thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_35|, ~back~0=v_~back~0_173} OutVars{thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_34|, thread2Thread1of2ForFork1_#t~post5#1=|v_thread2Thread1of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_172} AuxVars[] AssignedVars[thread2Thread1of2ForFork1_~flag~0#1, thread2Thread1of2ForFork1_#t~post5#1, ~back~0][55], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,692 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,692 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,692 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,692 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,693 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, 35#L65-5true, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,693 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,693 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 35#L65-5true, thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,694 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1180] L72-->L65-5: Formula: (and (= v_~back~0_172 (+ v_~back~0_173 1)) (= (ite (= (ite (= (mod |v_thread2Thread1of2ForFork1_~flag~0#1_35| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of2ForFork1_~flag~0#1_34|)) InVars {thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_35|, ~back~0=v_~back~0_173} OutVars{thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_34|, thread2Thread1of2ForFork1_#t~post5#1=|v_thread2Thread1of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_172} AuxVars[] AssignedVars[thread2Thread1of2ForFork1_~flag~0#1, thread2Thread1of2ForFork1_#t~post5#1, ~back~0][55], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,694 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#thread1EXITtrue, Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,694 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,694 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,694 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), 10#L38true, Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:14,695 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:14,695 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:14,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 67#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,697 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,697 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:14,697 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,697 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 499#true, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 117#L100-6true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:14,698 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,698 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,698 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:14,698 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 02:57:15,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,360 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,360 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,360 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,360 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,361 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,361 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,361 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,361 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,463 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,463 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,463 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 9#thread2EXITtrue, Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,481 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,481 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,481 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,481 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, 114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,482 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,482 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,482 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,482 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 68#L70true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,483 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,483 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,483 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,484 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 02:57:15,484 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,485 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,485 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,485 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,486 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 35#L65-5true, thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,486 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 35#L65-5true, thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,486 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,486 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 35#L65-5true, thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,487 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 35#L65-5true, thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,487 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,487 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,487 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 41#thread1EXITtrue, Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,488 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,488 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,488 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,488 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1180] L72-->L65-5: Formula: (and (= v_~back~0_172 (+ v_~back~0_173 1)) (= (ite (= (ite (= (mod |v_thread2Thread1of2ForFork1_~flag~0#1_35| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of2ForFork1_~flag~0#1_34|)) InVars {thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_35|, ~back~0=v_~back~0_173} OutVars{thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_34|, thread2Thread1of2ForFork1_#t~post5#1=|v_thread2Thread1of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_172} AuxVars[] AssignedVars[thread2Thread1of2ForFork1_~flag~0#1, thread2Thread1of2ForFork1_#t~post5#1, ~back~0][55], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,703 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,703 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,703 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 10#L38true, Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,704 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L79-->L65-5: Formula: (and (= v_~back~0_154 (+ v_~back~0_155 1)) (= (ite (= (ite (= (mod |v_thread2Thread2of2ForFork1_~flag~0#1_39| 256) 0) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_38|)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_39|, ~back~0=v_~back~0_155} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_38|, thread2Thread2of2ForFork1_#t~post7#1=|v_thread2Thread2of2ForFork1_#t~post7#1_8|, ~back~0=v_~back~0_154} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post7#1, ~back~0][125], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 35#L65-5true, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,704 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L72-->L65-5: Formula: (and (= (ite (= (ite (= 0 (mod |v_thread2Thread2of2ForFork1_~flag~0#1_43| 256)) 1 0) 0) 0 1) |v_thread2Thread2of2ForFork1_~flag~0#1_42|) (= (+ v_~back~0_159 1) v_~back~0_158)) InVars {thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_43|, ~back~0=v_~back~0_159} OutVars{thread2Thread2of2ForFork1_~flag~0#1=|v_thread2Thread2of2ForFork1_~flag~0#1_42|, thread2Thread2of2ForFork1_#t~post5#1=|v_thread2Thread2of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_158} AuxVars[] AssignedVars[thread2Thread2of2ForFork1_~flag~0#1, thread2Thread2of2ForFork1_#t~post5#1, ~back~0][126], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, 35#L65-5true, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,704 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,704 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1180] L72-->L65-5: Formula: (and (= v_~back~0_172 (+ v_~back~0_173 1)) (= (ite (= (ite (= (mod |v_thread2Thread1of2ForFork1_~flag~0#1_35| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of2ForFork1_~flag~0#1_34|)) InVars {thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_35|, ~back~0=v_~back~0_173} OutVars{thread2Thread1of2ForFork1_~flag~0#1=|v_thread2Thread1of2ForFork1_~flag~0#1_34|, thread2Thread1of2ForFork1_#t~post5#1=|v_thread2Thread1of2ForFork1_#t~post5#1_8|, ~back~0=v_~back~0_172} AuxVars[] AssignedVars[thread2Thread1of2ForFork1_~flag~0#1, thread2Thread1of2ForFork1_#t~post5#1, ~back~0][55], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 19#L57true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,705 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L57-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_26| 256) 0) (= |v_thread1Thread1of2ForFork0_#res#1.base_16| 0) (= |v_thread1Thread1of2ForFork0_#res#1.offset_16| 0)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|} OutVars{thread1Thread1of2ForFork0_#res#1.offset=|v_thread1Thread1of2ForFork0_#res#1.offset_16|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_26|, thread1Thread1of2ForFork0_#res#1.base=|v_thread1Thread1of2ForFork0_#res#1.base_16|} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_#res#1.offset, thread1Thread1of2ForFork0_#res#1.base][47], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 41#thread1EXITtrue, Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,705 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,705 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L57-->L38: Formula: (and (= |v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= (mod |v_thread1Thread1of2ForFork0_~cond~0#1_24| 256) 0)) (= (ite (and (< v_~front~0_144 v_~n~0_146) (<= 0 v_~front~0_144)) 1 0) |v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|)) InVars {thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} OutVars{thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of2ForFork0_~cond~0#1=|v_thread1Thread1of2ForFork0_~cond~0#1_24|, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1_42|, ~n~0=v_~n~0_146, ~front~0=v_~front~0_144} AuxVars[] AssignedVars[thread1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of2ForFork0_assume_abort_if_not_~cond#1][48], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L53-2true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1150#true, Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 1132#(= ~sum~0 0), 10#L38true, Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0)]) [2023-08-04 02:57:15,705 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,706 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,706 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,706 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,745 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,745 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,745 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,745 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), 74#L100-11true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1InUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,746 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,746 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 9#thread2EXITtrue, Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,747 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, 114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,747 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,747 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 68#L70true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,748 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,748 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,749 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,749 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, 35#L65-5true, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,773 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,773 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,773 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,773 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 9#thread2EXITtrue, Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,822 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, 114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,822 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,822 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 68#L70true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,823 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,823 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,823 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 77#thread2EXITtrue, Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,824 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,824 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,824 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,824 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,832 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,832 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,833 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,833 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 97#L65-5true, 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,834 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,834 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,834 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-04 02:57:15,834 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 02:57:15,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 9#thread2EXITtrue, Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,972 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,972 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,972 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,972 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, 114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,973 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,973 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,973 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,973 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 68#L70true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,974 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,974 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,974 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,974 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,974 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,975 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,975 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 9#thread2EXITtrue, Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,997 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,997 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,997 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,997 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, 114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,998 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 68#L70true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,998 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,998 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 67#L79true, 1150#true, 1529#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:15,999 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:15,999 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), thread1Thread1of2ForFork0InUse, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,000 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,000 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,000 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,000 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,001 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,001 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,001 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,001 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,002 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 4#L68true, Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,002 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,002 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 9#thread2EXITtrue, Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,029 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,029 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,029 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,029 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [114#L77true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,030 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,030 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,030 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,030 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 68#L70true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,031 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,031 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,031 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,031 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,062 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,062 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,062 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,063 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,063 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,063 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 02:57:16,063 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-04 02:57:16,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,141 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,141 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,141 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,142 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,142 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,142 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,142 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,142 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 63#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,143 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,143 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,143 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,143 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 7#L101-4true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,153 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 67#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,153 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,153 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 61#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,154 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,154 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,154 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,154 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 67#L79true, 7#L101-4true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), 1129#true, Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,165 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,165 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,165 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,165 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 145#L72true, 683#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 7#L101-4true, 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork1NotInUse, Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,166 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,166 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,166 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,166 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1150#true, 1529#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,502 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,502 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 02:57:16,502 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,502 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-04 02:57:16,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1150#true, 1529#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,559 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,559 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,559 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,559 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:16,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, thread1Thread1of2ForFork0InUse, 1129#true, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,584 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,584 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,584 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,584 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:16,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, 97#L65-5true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 681#true, 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,586 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,586 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,586 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-04 02:57:16,586 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 02:57:16,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,618 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,618 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,618 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:16,618 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 61#L79true, 1529#true, 1150#true, 75#L101-8true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,621 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,621 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:16,621 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,621 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 4#L68true, Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,622 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,622 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:16,622 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,622 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), 77#thread2EXITtrue, Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,635 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,635 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,635 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 02:57:16,635 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-04 02:57:16,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 63#L72true, 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1529#true, 1150#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,656 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,656 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:16,656 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,656 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L53-2-->L55: Formula: (= (+ v_~element~0_54 v_~sum~0_80) v_~sum~0_79) InVars {~sum~0=v_~sum~0_80, ~element~0=v_~element~0_54} OutVars{~sum~0=v_~sum~0_79, ~element~0=v_~element~0_54, thread1Thread2of2ForFork0_#t~post2#1=|v_thread1Thread2of2ForFork0_#t~post2#1_11|} AuxVars[] AssignedVars[~sum~0, thread1Thread2of2ForFork0_#t~post2#1][234], [111#L101-3true, Black: 194#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 69#L55true, 1524#true, Black: 338#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 271#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 61#L79true, 1150#true, 1529#true, Black: 1490#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), Black: 1495#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1467#(or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)), Black: 1499#(and (or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))) (= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0)), Black: 1370#(= (mod |thread1Thread2of2ForFork0_~cond~0#1| 256) 0), Black: 222#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1497#(and (or (< 0 (mod |thread1Thread1of2ForFork0_~cond~0#1| 256)) (<= ~back~0 ~front~0)) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1170#(or (and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)) (and (< ~front~0 ~back~0) (= |thread1Thread1of2ForFork0_~cond~0#1| 1))), Black: 890#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 502#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1493#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1219#(= |thread1Thread2of2ForFork0_~cond~0#1| 0), 1136#true, Black: 1132#(= ~sum~0 0), Black: 1131#(and (= ~sum~0 0) (or (and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), Black: 344#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1517#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1520#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n~0 0)), Black: 681#true, Black: 1139#(and (= |thread1Thread1of2ForFork0_~cond~0#1| 0) (<= ~back~0 ~front~0)), 684#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1526#(= 1 |thread2Thread1of2ForFork1_~flag~0#1|), thread2Thread1of2ForFork1InUse, 1129#true, thread1Thread1of2ForFork0InUse, Black: 1146#(and (<= ~back~0 ~front~0) (= |thread1Thread2of2ForFork0_~cond~0#1| 0)), Black: 1145#(<= ~back~0 ~front~0), 178#L55true]) [2023-08-04 02:57:16,658 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,658 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,658 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 02:57:16,658 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-04 02:57:16,675 INFO L124 PetriNetUnfolderBase]: 451629/606596 cut-off events. [2023-08-04 02:57:16,675 INFO L125 PetriNetUnfolderBase]: For 1325102/1350673 co-relation queries the response was YES. [2023-08-04 02:57:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005282 conditions, 606596 events. 451629/606596 cut-off events. For 1325102/1350673 co-relation queries the response was YES. Maximal size of possible extension queue 17160. Compared 4699484 event pairs, 226361 based on Foata normal form. 15397/596210 useless extension candidates. Maximal degree in co-relation 2005236. Up to 429589 conditions per place. [2023-08-04 02:57:22,571 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 214 selfloop transitions, 17 changer transitions 0/259 dead transitions. [2023-08-04 02:57:22,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 259 transitions, 2004 flow [2023-08-04 02:57:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:57:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:57:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-08-04 02:57:22,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134199134199134 [2023-08-04 02:57:22,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-08-04 02:57:22,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-08-04 02:57:22,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:57:22,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-08-04 02:57:22,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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-04 02:57:22,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:57:22,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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-04 02:57:22,575 INFO L175 Difference]: Start difference. First operand has 115 places, 170 transitions, 1031 flow. Second operand 3 states and 593 transitions. [2023-08-04 02:57:22,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 259 transitions, 2004 flow [2023-08-04 02:58:36,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 259 transitions, 1983 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:58:36,275 INFO L231 Difference]: Finished difference. Result has 117 places, 178 transitions, 1121 flow [2023-08-04 02:58:36,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=117, PETRI_TRANSITIONS=178} [2023-08-04 02:58:36,276 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 55 predicate places. [2023-08-04 02:58:36,276 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 178 transitions, 1121 flow [2023-08-04 02:58:36,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-04 02:58:36,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:58:36,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:58:36,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 02:58:36,276 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:58:36,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:58:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash -56021714, now seen corresponding path program 1 times [2023-08-04 02:58:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:58:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455173478] [2023-08-04 02:58:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:58:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:58:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:58:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455173478] [2023-08-04 02:58:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455173478] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:58:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186542972] [2023-08-04 02:58:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:58:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:58:36,941 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:58:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 02:58:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:37,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 02:58:37,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:58:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:37,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:58:37,689 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:58:37,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2023-08-04 02:58:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:58:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186542972] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:58:37,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:58:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-08-04 02:58:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999589567] [2023-08-04 02:58:37,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:58:37,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-04 02:58:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:58:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-04 02:58:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2023-08-04 02:58:39,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 385 [2023-08-04 02:58:39,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 178 transitions, 1121 flow. Second operand has 26 states, 26 states have (on average 133.57692307692307) internal successors, (3473), 26 states have internal predecessors, (3473), 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-04 02:58:39,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:58:39,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 385 [2023-08-04 02:58:39,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand